Base | Representation |
---|---|
bin | 11101100110101100010010… |
… | …011001010011100110110000 |
3 | 122002000012202010101122012221 |
4 | 131212230102121103212300 |
5 | 114031213143000431112 |
6 | 1140530030114130424 |
7 | 36265541640103600 |
oct | 3546542231234660 |
9 | 562005663348187 |
10 | 130202242202032 |
11 | 385395083a2a60 |
12 | 1272a097580a14 |
13 | 5786032290910 |
14 | 2421b71d84c00 |
15 | 100bcd47c3e07 |
hex | 766b126539b0 |
130202242202032 has 240 divisors, whose sum is σ = 353164989056544. Its totient is φ = 45683882496000.
The previous prime is 130202242202029. The next prime is 130202242202057. The reversal of 130202242202032 is 230202242202031.
It is a junction number, because it is equal to n+sod(n) for n = 130202242201988 and 130202242202006.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9566319 + ... + 18759502.
Almost surely, 2130202242202032 is an apocalyptic number.
It is an amenable number.
130202242202032 is an abundant number, since it is smaller than the sum of its proper divisors (222962746854512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130202242202032 is a wasteful number, since it uses less digits than its factorization.
130202242202032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28325908 (or 28325895 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 130202242202032 its reverse (230202242202031), we get a palindrome (360404484404063).
Subtracting 130202242202032 from its reverse (230202242202031), we obtain a palindrome (99999999999999).
The spelling of 130202242202032 in words is "one hundred thirty trillion, two hundred two billion, two hundred forty-two million, two hundred two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •