Base | Representation |
---|---|
bin | 1001001011111001110110… |
… | …0010001100100101011101 |
3 | 1022202120011002221001222021 |
4 | 2102332131202030211131 |
5 | 2310440011420202003 |
6 | 33251532121220141 |
7 | 2061465111556246 |
oct | 222763542144535 |
9 | 38676132831867 |
10 | 10100111100253 |
11 | 3244484452409 |
12 | 1171576931651 |
13 | 583589997055 |
14 | 26cbc2c2dccd |
15 | 127ad8cc62bd |
hex | 92f9d88c95d |
10100111100253 has 2 divisors, whose sum is σ = 10100111100254. Its totient is φ = 10100111100252.
The previous prime is 10100111100187. The next prime is 10100111100281. The reversal of 10100111100253 is 35200111100101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6150980333689 + 3949130766564 = 2480117^2 + 1987242^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10100111100253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10100111100293) 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, 5050055550126 + 5050055550127.
It is an arithmetic number, because the mean of its divisors is an integer number (5050055550127).
Almost surely, 210100111100253 is an apocalyptic number.
It is an amenable number.
10100111100253 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100111100253 is an equidigital number, since it uses as much as digits as its factorization.
10100111100253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30, while the sum is 16.
Adding to 10100111100253 its reverse (35200111100101), we get a palindrome (45300222200354).
The spelling of 10100111100253 in words is "ten trillion, one hundred billion, one hundred eleven million, one hundred thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •