Base | Representation |
---|---|
bin | 10110110010000111100011… |
… | …101100000010010011110100 |
3 | 111010210010120210001200201220 |
4 | 112302013203230002103310 |
5 | 101113143334134121322 |
6 | 553035431055150340 |
7 | 30051201652124550 |
oct | 2662074354022364 |
9 | 433703523050656 |
10 | 100201112020212 |
11 | 29a22064552645 |
12 | b2a37918153b0 |
13 | 43bac02964038 |
14 | 1aa5a8c880860 |
15 | b8b6da6a155c |
hex | 5b21e3b024f4 |
100201112020212 has 96 divisors (see below), whose sum is σ = 267868709412864. Its totient is φ = 28557575222400.
The previous prime is 100201112020133. The next prime is 100201112020249. The reversal of 100201112020212 is 212020211102001.
It is a junction number, because it is equal to n+sod(n) for n = 100201112020191 and 100201112020200.
It is a congruent number.
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, 313271287 + ... + 313590977.
It is an arithmetic number, because the mean of its divisors is an integer number (2790299056384).
Almost surely, 2100201112020212 is an apocalyptic number.
100201112020212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100201112020212 is an abundant number, since it is smaller than the sum of its proper divisors (167667597392652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100201112020212 is a wasteful number, since it uses less digits than its factorization.
100201112020212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 328989 (or 328987 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 100201112020212 its reverse (212020211102001), we get a palindrome (312221323122213).
The spelling of 100201112020212 in words is "one hundred trillion, two hundred one billion, one hundred twelve million, twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •