Base | Representation |
---|---|
bin | 10111001100011101010110… |
… | …100110100100110011111001 |
3 | 111101012011210101211102000021 |
4 | 113030131112212210303321 |
5 | 101332322440111400441 |
6 | 1000543150313010441 |
7 | 30326032105235422 |
oct | 2714352646446371 |
9 | 441164711742007 |
10 | 102011221200121 |
11 | 2a55a796a38772 |
12 | b53655b6b3a21 |
13 | 44bc8033a26ac |
14 | 1b29525ab2649 |
15 | bbd82c9823d1 |
hex | 5cc7569a4cf9 |
102011221200121 has 2 divisors, whose sum is σ = 102011221200122. Its totient is φ = 102011221200120.
The previous prime is 102011221200061. The next prime is 102011221200127. The reversal of 102011221200121 is 121002122110201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79788859516521 + 22222361683600 = 8932461^2 + 4714060^2 .
It is a cyclic number.
It is not a de Polignac number, because 102011221200121 - 29 = 102011221199609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102011221200095 and 102011221200104.
It is not a weakly prime, because it can be changed into another prime (102011221200127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005610600060 + 51005610600061.
It is an arithmetic number, because the mean of its divisors is an integer number (51005610600061).
Almost surely, 2102011221200121 is an apocalyptic number.
It is an amenable number.
102011221200121 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011221200121 is an equidigital number, since it uses as much as digits as its factorization.
102011221200121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102011221200121 its reverse (121002122110201), we get a palindrome (223013343310322).
The spelling of 102011221200121 in words is "one hundred two trillion, eleven billion, two hundred twenty-one million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •