Base | Representation |
---|---|
bin | 10111001110000100101101… |
… | …011101111010001010011001 |
3 | 111101120210020201102100101001 |
4 | 113032010231131322022121 |
5 | 101341132231223241441 |
6 | 1001110142514225001 |
7 | 30340041215254315 |
oct | 2716045535721231 |
9 | 441523221370331 |
10 | 102122200212121 |
11 | 2a5a2866777001 |
12 | b553b72285161 |
13 | 44ca10b66b72b |
14 | 1b30a52cdcb45 |
15 | bc16759b2731 |
hex | 5ce12d77a299 |
102122200212121 has 4 divisors (see below), whose sum is σ = 102135906057744. Its totient is φ = 102108494366500.
The previous prime is 102122200212077. The next prime is 102122200212143. The reversal of 102122200212121 is 121212002221201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102122200212121 - 213 = 102122200203929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102122270212121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6852911635 + ... + 6852926536.
It is an arithmetic number, because the mean of its divisors is an integer number (25533976514436).
Almost surely, 2102122200212121 is an apocalyptic number.
It is an amenable number.
102122200212121 is a deficient number, since it is larger than the sum of its proper divisors (13705845623).
102122200212121 is an equidigital number, since it uses as much as digits as its factorization.
102122200212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13705845622.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 102122200212121 its reverse (121212002221201), we get a palindrome (223334202433322).
The spelling of 102122200212121 in words is "one hundred two trillion, one hundred twenty-two billion, two hundred million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •