Base | Representation |
---|---|
bin | 10111001111001101010000… |
… | …101101110111101011001001 |
3 | 111101212020022202111220120210 |
4 | 113033031100231313223021 |
5 | 101343421301324310441 |
6 | 1001210024522511333 |
7 | 30345466530154422 |
oct | 2717152055675311 |
9 | 441766282456523 |
10 | 102200101010121 |
11 | 2a62290173a5a4 |
12 | b567093065549 |
13 | 450457490498a |
14 | 1b34722d58649 |
15 | bc36d4a25616 |
hex | 5cf350b77ac9 |
102200101010121 has 8 divisors (see below), whose sum is σ = 136272420461664. Its totient is φ = 68130591116000.
The previous prime is 102200101010107. The next prime is 102200101010129. The reversal of 102200101010121 is 121010101002201.
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 102200101010121 - 221 = 102200098912969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102200101010097 and 102200101010106.
It is not an unprimeable number, because it can be changed into a prime (102200101010129) 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, 702304476 + ... + 702449981.
It is an arithmetic number, because the mean of its divisors is an integer number (17034052557708).
Almost surely, 2102200101010121 is an apocalyptic number.
It is an amenable number.
102200101010121 is a deficient number, since it is larger than the sum of its proper divisors (34072319451543).
102200101010121 is a wasteful number, since it uses less digits than its factorization.
102200101010121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1404778711.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102200101010121 its reverse (121010101002201), we get a palindrome (223210202012322).
The spelling of 102200101010121 in words is "one hundred two trillion, two hundred billion, one hundred one million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •