Base | Representation |
---|---|
bin | 1000010101000101110… |
… | …1100110000000110000 |
3 | 111200100221002100210111 |
4 | 2011101131212000300 |
5 | 4321032230230021 |
6 | 145423423111104 |
7 | 13224111212026 |
oct | 2052135460060 |
9 | 450327070714 |
10 | 143100633136 |
11 | 5576363876a |
12 | 23898142494 |
13 | 1065707c266 |
14 | 6cd734c716 |
15 | 3ac80428e1 |
hex | 2151766030 |
143100633136 has 20 divisors (see below), whose sum is σ = 286201267264. Its totient is φ = 69242241600.
The previous prime is 143100633127. The next prime is 143100633211. The reversal of 143100633136 is 631336001341.
143100633136 is an admirable number.
It is a super-2 number, since 2×1431006331362 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 143100633098 and 143100633107.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 144254175 + ... + 144255166.
Almost surely, 2143100633136 is an apocalyptic number.
143100633136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
143100633136 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143100633136 is a wasteful number, since it uses less digits than its factorization.
143100633136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 288509380 (or 288509374 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 31.
Adding to 143100633136 its reverse (631336001341), we get a palindrome (774436634477).
The spelling of 143100633136 in words is "one hundred forty-three billion, one hundred million, six hundred thirty-three thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •