Base | Representation |
---|---|
bin | 1001010001110010001000… |
… | …1101001110101000000111 |
3 | 1100010012212200021212120012 |
4 | 2110130202031032220013 |
5 | 2314113344013034002 |
6 | 33410155210500435 |
7 | 2102002202460464 |
oct | 224344215165007 |
9 | 40105780255505 |
10 | 10201121221127 |
11 | 32832a8a94251 |
12 | 1189066a3471b |
13 | 58cc66848545 |
14 | 273a460b466b |
15 | 12a54ba40d52 |
hex | 9472234ea07 |
10201121221127 has 2 divisors, whose sum is σ = 10201121221128. Its totient is φ = 10201121221126.
The previous prime is 10201121221091. The next prime is 10201121221147. The reversal of 10201121221127 is 72112212110201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10201121221127 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10201121221147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100560610563 + 5100560610564.
It is an arithmetic number, because the mean of its divisors is an integer number (5100560610564).
Almost surely, 210201121221127 is an apocalyptic number.
10201121221127 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201121221127 is an equidigital number, since it uses as much as digits as its factorization.
10201121221127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 23.
Adding to 10201121221127 its reverse (72112212110201), we get a palindrome (82313333331328).
The spelling of 10201121221127 in words is "ten trillion, two hundred one billion, one hundred twenty-one million, two hundred twenty-one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •