Base | Representation |
---|---|
bin | 10110101111111100110001… |
… | …111001000110001101001100 |
3 | 111010020212221220001111111212 |
4 | 112233330301321012031030 |
5 | 101103223200123232112 |
6 | 552443144511033552 |
7 | 30034345212502550 |
oct | 2657746171061514 |
9 | 433225856044455 |
10 | 100052100211532 |
11 | 29974948242237 |
12 | b27a925b0b8b8 |
13 | 43a9b46048b91 |
14 | 1a9c794445860 |
15 | b878b871e522 |
hex | 5aff31e4634c |
100052100211532 has 24 divisors (see below), whose sum is σ = 200110679484576. Its totient is φ = 42878083148928.
The previous prime is 100052100211363. The next prime is 100052100211541. The reversal of 100052100211532 is 235112001250001.
It is a junction number, because it is equal to n+sod(n) for n = 100052100211498 and 100052100211507.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56968313 + ... + 58698320.
It is an arithmetic number, because the mean of its divisors is an integer number (8337944978524).
Almost surely, 2100052100211532 is an apocalyptic number.
It is an amenable number.
100052100211532 is an abundant number, since it is smaller than the sum of its proper divisors (100058579273044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100052100211532 is a wasteful number, since it uses less digits than its factorization.
100052100211532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115697537 (or 115697535 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 23.
Adding to 100052100211532 its reverse (235112001250001), we get a palindrome (335164101461533).
The spelling of 100052100211532 in words is "one hundred trillion, fifty-two billion, one hundred million, two hundred eleven thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •