Base | Representation |
---|---|
bin | 10110101111001100010001… |
… | …000101011110110000001001 |
3 | 111010001220111122111211222001 |
4 | 112233030101011132300021 |
5 | 101101400010102431441 |
6 | 552403212005231001 |
7 | 30030522321643111 |
oct | 2657142105366011 |
9 | 433056448454861 |
10 | 100000010202121 |
11 | 29954847845187 |
12 | b270809102461 |
13 | 43a4c642a87c3 |
14 | 1a9a05230a041 |
15 | b8636a637731 |
hex | 5af31115ec09 |
100000010202121 has 8 divisors (see below), whose sum is σ = 104350093475904. Its totient is φ = 95650114990320.
The previous prime is 100000010202097. The next prime is 100000010202149. The reversal of 100000010202121 is 121202010000001.
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 100000010202121 - 25 = 100000010202089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100000010202098 and 100000010202107.
It is not an unprimeable number, because it can be changed into a prime (100000010200121) 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, 45928351 + ... + 48056356.
It is an arithmetic number, because the mean of its divisors is an integer number (13043761684488).
Almost surely, 2100000010202121 is an apocalyptic number.
It is an amenable number.
100000010202121 is a deficient number, since it is larger than the sum of its proper divisors (4350083273783).
100000010202121 is an equidigital number, since it uses as much as digits as its factorization.
100000010202121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94030991.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100000010202121 its reverse (121202010000001), we get a palindrome (221202020202122).
The spelling of 100000010202121 in words is "one hundred trillion, ten million, two hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •