Base | Representation |
---|---|
bin | 10111000000101010000010… |
… | …000110010001010000110001 |
3 | 111021022122102002022220001202 |
4 | 113000222002012101100301 |
5 | 101231031003220010001 |
6 | 555122421523140545 |
7 | 30213321230561261 |
oct | 2700520206212061 |
9 | 437278362286052 |
10 | 101200202110001 |
11 | 2a277845897525 |
12 | b42533ab14755 |
13 | 44611a4576467 |
14 | 1adc18a10b7a1 |
15 | ba76b20ce96b |
hex | 5c0a82191431 |
101200202110001 has 2 divisors, whose sum is σ = 101200202110002. Its totient is φ = 101200202110000.
The previous prime is 101200202109991. The next prime is 101200202110003. The reversal of 101200202110001 is 100011202002101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61591417920400 + 39608784189601 = 7848020^2 + 6293551^2 .
It is a cyclic number.
It is not a de Polignac number, because 101200202110001 - 246 = 30831457932337 is a prime.
Together with 101200202110003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (101200202110003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50600101055000 + 50600101055001.
It is an arithmetic number, because the mean of its divisors is an integer number (50600101055001).
Almost surely, 2101200202110001 is an apocalyptic number.
It is an amenable number.
101200202110001 is a deficient number, since it is larger than the sum of its proper divisors (1).
101200202110001 is an equidigital number, since it uses as much as digits as its factorization.
101200202110001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101200202110001 its reverse (100011202002101), we get a palindrome (201211404112102).
The spelling of 101200202110001 in words is "one hundred one trillion, two hundred billion, two hundred two million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •