Base | Representation |
---|---|
bin | 101110101010100001… |
… | …1000101101101111101 |
3 | 100120122212220101211210 |
4 | 1131111003011231331 |
5 | 3120213021333041 |
6 | 114011504035033 |
7 | 10145216321454 |
oct | 1352503055575 |
9 | 316585811753 |
10 | 100211121021 |
11 | 39554624490 |
12 | 17508602a79 |
13 | 95b048b91b |
14 | 4bc90d9b9b |
15 | 2917a3e016 |
hex | 17550c5b7d |
100211121021 has 8 divisors (see below), whose sum is σ = 145761630624. Its totient is φ = 60734012720.
The previous prime is 100211121019. The next prime is 100211121029. The reversal of 100211121021 is 120121112001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100211121021 - 21 = 100211121019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100211120988 and 100211121006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100211121029) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1518350286 + ... + 1518350351.
It is an arithmetic number, because the mean of its divisors is an integer number (18220203828).
Almost surely, 2100211121021 is an apocalyptic number.
100211121021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100211121021 is a deficient number, since it is larger than the sum of its proper divisors (45550509603).
100211121021 is a wasteful number, since it uses less digits than its factorization.
100211121021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3036700651.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100211121021 its reverse (120121112001), we get a palindrome (220332233022).
The spelling of 100211121021 in words is "one hundred billion, two hundred eleven million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •