Base | Representation |
---|---|
bin | 10110101111001110001000… |
… | …111100000100101100100110 |
3 | 111010002002200210012001212110 |
4 | 112233032020330010230212 |
5 | 101101413114334031042 |
6 | 552404143315501450 |
7 | 30030623206315356 |
oct | 2657161074045446 |
9 | 433062623161773 |
10 | 100002021002022 |
11 | 29955689898987 |
12 | b27108a5b7886 |
13 | 43a51c4a64829 |
14 | 1a9a1a33b6b66 |
15 | b86436e3009c |
hex | 5af388f04b26 |
100002021002022 has 32 divisors (see below), whose sum is σ = 202182111147744. Its totient is φ = 32971641984000.
The previous prime is 100002021002021. The next prime is 100002021002077. The reversal of 100002021002022 is 220200120200001.
It is a junction number, because it is equal to n+sod(n) for n = 100002021001989 and 100002021002007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100002021002021) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 80194123 + ... + 81431574.
It is an arithmetic number, because the mean of its divisors is an integer number (6318190973367).
Almost surely, 2100002021002022 is an apocalyptic number.
100002021002022 is an abundant number, since it is smaller than the sum of its proper divisors (102180090145722).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100002021002022 is a wasteful number, since it uses less digits than its factorization.
100002021002022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161626824.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 100002021002022 its reverse (220200120200001), we get a palindrome (320202141202023).
The spelling of 100002021002022 in words is "one hundred trillion, two billion, twenty-one million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •