Base | Representation |
---|---|
bin | 10111001101111001010110… |
… | …010110000100011110110001 |
3 | 111101112121202112200022121211 |
4 | 113031321112112010132301 |
5 | 101340432240241334301 |
6 | 1001100404213320121 |
7 | 30336130005560503 |
oct | 2715712626043661 |
9 | 441477675608554 |
10 | 102110001121201 |
11 | 2a5986766a3487 |
12 | b551728936041 |
13 | 44c8c161aa638 |
14 | 1b30216a97d73 |
15 | bc11aea17051 |
hex | 5cde565847b1 |
102110001121201 has 2 divisors, whose sum is σ = 102110001121202. Its totient is φ = 102110001121200.
The previous prime is 102110001121199. The next prime is 102110001121229. The reversal of 102110001121201 is 102121100011201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96684250824225 + 5425750296976 = 9832815^2 + 2329324^2 .
It is a cyclic number.
It is not a de Polignac number, because 102110001121201 - 21 = 102110001121199 is a prime.
Together with 102110001121199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (102110002121201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51055000560600 + 51055000560601.
It is an arithmetic number, because the mean of its divisors is an integer number (51055000560601).
Almost surely, 2102110001121201 is an apocalyptic number.
It is an amenable number.
102110001121201 is a deficient number, since it is larger than the sum of its proper divisors (1).
102110001121201 is an equidigital number, since it uses as much as digits as its factorization.
102110001121201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102110001121201 its reverse (102121100011201), we get a palindrome (204231101132402).
The spelling of 102110001121201 in words is "one hundred two trillion, one hundred ten billion, one million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •