Base | Representation |
---|---|
bin | 10111001110000100101000… |
… | …101011111011101000110101 |
3 | 111101120210001010111020220120 |
4 | 113032010220223323220311 |
5 | 101341132100210031401 |
6 | 1001110130531122153 |
7 | 30340036222425003 |
oct | 2716045053735065 |
9 | 441523033436816 |
10 | 102122120002101 |
11 | 2a5a2825472031 |
12 | b553b4b443359 |
13 | 44ca0c7b66894 |
14 | 1b30a463bda73 |
15 | bc166d91b836 |
hex | 5ce128afba35 |
102122120002101 has 4 divisors (see below), whose sum is σ = 136162826669472. Its totient is φ = 68081413334732.
The previous prime is 102122120002099. The next prime is 102122120002171. The reversal of 102122120002101 is 101200021221201.
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 102122120002101 - 21 = 102122120002099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102122120002171) 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, 17020353333681 + ... + 17020353333686.
It is an arithmetic number, because the mean of its divisors is an integer number (34040706667368).
Almost surely, 2102122120002101 is an apocalyptic number.
It is an amenable number.
102122120002101 is a deficient number, since it is larger than the sum of its proper divisors (34040706667371).
102122120002101 is an equidigital number, since it uses as much as digits as its factorization.
102122120002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34040706667370.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102122120002101 its reverse (101200021221201), we get a palindrome (203322141223302).
The spelling of 102122120002101 in words is "one hundred two trillion, one hundred twenty-two billion, one hundred twenty million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •