Base | Representation |
---|---|
bin | 10110101111010101110001… |
… | …000110110110110001111100 |
3 | 111010002212211120022122220102 |
4 | 112233111301012312301330 |
5 | 101102031403021010022 |
6 | 552412020130140232 |
7 | 30031333156143260 |
oct | 2657256106666174 |
9 | 433085746278812 |
10 | 100010211110012 |
11 | 29959101a02275 |
12 | b272795421678 |
13 | 43a5bcb7aa588 |
14 | 1a9a73d00a0a0 |
15 | b86765e7da92 |
hex | 5af5711b6c7c |
100010211110012 has 24 divisors (see below), whose sum is σ = 200022944770656. Its totient is φ = 42860978500608.
The previous prime is 100010211109943. The next prime is 100010211110081. The reversal of 100010211110012 is 210011112010001.
It is an interprime number because it is at equal distance from previous prime (100010211109943) and next prime (100010211110081).
It is a junction number, because it is equal to n+sod(n) for n = 100010211109975 and 100010211110002.
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, 20258933 + ... + 24707180.
It is an arithmetic number, because the mean of its divisors is an integer number (8334289365444).
Almost surely, 2100010211110012 is an apocalyptic number.
It is an amenable number.
100010211110012 is an abundant number, since it is smaller than the sum of its proper divisors (100012733660644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010211110012 is a wasteful number, since it uses less digits than its factorization.
100010211110012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45045557 (or 45045555 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100010211110012 its reverse (210011112010001), we get a palindrome (310021323120013).
The spelling of 100010211110012 in words is "one hundred trillion, ten billion, two hundred eleven million, one hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •