Base | Representation |
---|---|
bin | 10110110010010000000010… |
… | …000110011110001000110100 |
3 | 111010211000001222122202222020 |
4 | 112302100002012132020310 |
5 | 101113321003310413022 |
6 | 553043534055433140 |
7 | 30051643322313114 |
oct | 2662200206361064 |
9 | 433730058582866 |
10 | 100210212201012 |
11 | 29a25a04349121 |
12 | b2a54b13857b0 |
13 | 43bba230bc1c4 |
14 | 1aa62b32d3044 |
15 | b8ba6e56b35c |
hex | 5b240219e234 |
100210212201012 has 24 divisors (see below), whose sum is σ = 233824806364800. Its totient is φ = 33403264367616.
The previous prime is 100210212200957. The next prime is 100210212201031. The reversal of 100210212201012 is 210102212012001.
It is a junction number, because it is equal to n+sod(n) for n = 100210212200982 and 100210212201000.
It is a congruent number.
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, 14452812 + ... + 20231267.
It is an arithmetic number, because the mean of its divisors is an integer number (9742700265200).
Almost surely, 2100210212201012 is an apocalyptic number.
100210212201012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100210212201012 is an abundant number, since it is smaller than the sum of its proper divisors (133614594163788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100210212201012 is a wasteful number, since it uses less digits than its factorization.
100210212201012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34924855 (or 34924853 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 100210212201012 its reverse (210102212012001), we get a palindrome (310312424213013).
The spelling of 100210212201012 in words is "one hundred trillion, two hundred ten billion, two hundred twelve million, two hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •