Base | Representation |
---|---|
bin | 10110111111100000011101… |
… | …001101111100000100011001 |
3 | 111021001002111022022120010212 |
4 | 112333200131031330010121 |
5 | 101223232204223211301 |
6 | 555022234342220505 |
7 | 30204523415525633 |
oct | 2677403515740431 |
9 | 437032438276125 |
10 | 101121200210201 |
11 | 2a247295326946 |
12 | b411b71424735 |
13 | 44568c4164ba2 |
14 | 1ad8413b47a53 |
15 | ba55db5694bb |
hex | 5bf81d37c119 |
101121200210201 has 2 divisors, whose sum is σ = 101121200210202. Its totient is φ = 101121200210200.
The previous prime is 101121200210197. The next prime is 101121200210203. The reversal of 101121200210201 is 102012002121101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100254141264601 + 867058945600 = 10012699^2 + 931160^2 .
It is a cyclic number.
It is not a de Polignac number, because 101121200210201 - 22 = 101121200210197 is a prime.
Together with 101121200210203, 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 (101121200210203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560600105100 + 50560600105101.
It is an arithmetic number, because the mean of its divisors is an integer number (50560600105101).
Almost surely, 2101121200210201 is an apocalyptic number.
It is an amenable number.
101121200210201 is a deficient number, since it is larger than the sum of its proper divisors (1).
101121200210201 is an equidigital number, since it uses as much as digits as its factorization.
101121200210201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101121200210201 its reverse (102012002121101), we get a palindrome (203133202331302).
The spelling of 101121200210201 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred million, two hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •