Base | Representation |
---|---|
bin | 10111001110000010110000… |
… | …111100001100110110101001 |
3 | 111101120120212010012102111102 |
4 | 113032002300330030312221 |
5 | 101341113441404013001 |
6 | 1001105155323211145 |
7 | 30336635356253642 |
oct | 2716026074146651 |
9 | 441516763172442 |
10 | 102120111001001 |
11 | 2a5a1994437845 |
12 | b55368a676ab5 |
13 | 44c9b6788a532 |
14 | 1b308d56606c9 |
15 | bc15a237be6b |
hex | 5ce0b0f0cda9 |
102120111001001 has 2 divisors, whose sum is σ = 102120111001002. Its totient is φ = 102120111001000.
The previous prime is 102120111000991. The next prime is 102120111001049. The reversal of 102120111001001 is 100100111021201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64533892823401 + 37586218177600 = 8033299^2 + 6130760^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102120111001001 is a prime.
It is not a weakly prime, because it can be changed into another prime (102120111001091) 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 as a sum of consecutive naturals, namely, 51060055500500 + 51060055500501.
It is an arithmetic number, because the mean of its divisors is an integer number (51060055500501).
Almost surely, 2102120111001001 is an apocalyptic number.
It is an amenable number.
102120111001001 is a deficient number, since it is larger than the sum of its proper divisors (1).
102120111001001 is an equidigital number, since it uses as much as digits as its factorization.
102120111001001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 102120111001001 its reverse (100100111021201), we get a palindrome (202220222022202).
The spelling of 102120111001001 in words is "one hundred two trillion, one hundred twenty billion, one hundred eleven million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •