Base | Representation |
---|---|
bin | 10111001110001011111111… |
… | …000101101000100111001000 |
3 | 111101121112102010201212220012 |
4 | 113032023333011220213020 |
5 | 101341244231040001212 |
6 | 1001113514012451052 |
7 | 30340435622524610 |
oct | 2716137705504710 |
9 | 441545363655805 |
10 | 102130012031432 |
11 | 2a5a61052a4520 |
12 | b555592479a88 |
13 | 44caa84c05218 |
14 | 1b311945bda40 |
15 | bc19816da922 |
hex | 5ce2ff1689c8 |
102130012031432 has 128 divisors (see below), whose sum is σ = 259976932992000. Its totient is φ = 36396770376960.
The previous prime is 102130012031393. The next prime is 102130012031449. The reversal of 102130012031432 is 234130210031201.
It is a super-3 number, since 3×1021300120314323 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102130012031398 and 102130012031407.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 150110198 + ... + 150789029.
It is an arithmetic number, because the mean of its divisors is an integer number (2031069789000).
Almost surely, 2102130012031432 is an apocalyptic number.
It is an amenable number.
102130012031432 is an abundant number, since it is smaller than the sum of its proper divisors (157846920960568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102130012031432 is a wasteful number, since it uses less digits than its factorization.
102130012031432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300899299 (or 300899295 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 102130012031432 its reverse (234130210031201), we get a palindrome (336260222062633).
The spelling of 102130012031432 in words is "one hundred two trillion, one hundred thirty billion, twelve million, thirty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •