Base | Representation |
---|---|
bin | 101111100110011001… |
… | …0101111100111101001 |
3 | 100202211220011012211012 |
4 | 1133030302233213221 |
5 | 3133321321231441 |
6 | 114543111313305 |
7 | 10246052350304 |
oct | 1371462574751 |
9 | 322756135735 |
10 | 102220102121 |
11 | 3a395645745 |
12 | 1798937b835 |
13 | 984075bb37 |
14 | 4d39c51b3b |
15 | 29d40c79eb |
hex | 17cccaf9e9 |
102220102121 has 8 divisors (see below), whose sum is σ = 102959822784. Its totient is φ = 101481503760.
The previous prime is 102220102093. The next prime is 102220102129. The reversal of 102220102121 is 121201022201.
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 102220102121 - 210 = 102220101097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102220102096 and 102220102105.
It is not an unprimeable number, because it can be changed into a prime (102220102129) 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 7 ways as a sum of consecutive naturals, for example, 97325 + ... + 462506.
It is an arithmetic number, because the mean of its divisors is an integer number (12869977848).
Almost surely, 2102220102121 is an apocalyptic number.
It is an amenable number.
102220102121 is a deficient number, since it is larger than the sum of its proper divisors (739720663).
102220102121 is a wasteful number, since it uses less digits than its factorization.
102220102121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 561151.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102220102121 its reverse (121201022201), we get a palindrome (223421124322).
The spelling of 102220102121 in words is "one hundred two billion, two hundred twenty million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •