Base | Representation |
---|---|
bin | 10111001101110000001111… |
… | …011001111100011111011001 |
3 | 111101111200111221200201002220 |
4 | 113031300033121330133121 |
5 | 101340302223040120441 |
6 | 1001052105524014253 |
7 | 30335332441231332 |
oct | 2715601731743731 |
9 | 441450457621086 |
10 | 102100221020121 |
11 | 2a594508022815 |
12 | b54b859531389 |
13 | 44c8017c2388c |
14 | 1b2d969c17289 |
15 | bc0cdb0e4466 |
hex | 5cdc0f67c7d9 |
102100221020121 has 8 divisors (see below), whose sum is σ = 136165712330400. Its totient is φ = 68050771861632.
The previous prime is 102100221020117. The next prime is 102100221020123. The reversal of 102100221020121 is 121020122001201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102100221020121 - 22 = 102100221020117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102100221020121.
It is not an unprimeable number, because it can be changed into a prime (102100221020123) 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, 4010523096 + ... + 4010548553.
It is an arithmetic number, because the mean of its divisors is an integer number (17020714041300).
Almost surely, 2102100221020121 is an apocalyptic number.
It is an amenable number.
102100221020121 is a deficient number, since it is larger than the sum of its proper divisors (34065491310279).
102100221020121 is an equidigital number, since it uses as much as digits as its factorization.
102100221020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8021075895.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102100221020121 its reverse (121020122001201), we get a palindrome (223120343021322).
The spelling of 102100221020121 in words is "one hundred two trillion, one hundred billion, two hundred twenty-one million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •