Base | Representation |
---|---|
bin | 10000010011001011001… |
… | …010011100100100001011 |
3 | 10222002011200210002020212 |
4 | 100103023022130210023 |
5 | 121322431100312001 |
6 | 2214322234311335 |
7 | 143632056665345 |
oct | 20231312344413 |
9 | 3862150702225 |
10 | 1120100010251 |
11 | 3a2039289212 |
12 | 1610bb28854b |
13 | 818180cb271 |
14 | 3c2dab84295 |
15 | 1e20a3c47bb |
hex | 104cb29c90b |
1120100010251 has 2 divisors, whose sum is σ = 1120100010252. Its totient is φ = 1120100010250.
The previous prime is 1120100010193. The next prime is 1120100010257. The reversal of 1120100010251 is 1520100010211.
It is a strong prime.
It is an emirp because it is prime and its reverse (1520100010211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1120100010251 - 26 = 1120100010187 is a prime.
It is not a weakly prime, because it can be changed into another prime (1120100010257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560050005125 + 560050005126.
It is an arithmetic number, because the mean of its divisors is an integer number (560050005126).
Almost surely, 21120100010251 is an apocalyptic number.
1120100010251 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120100010251 is an equidigital number, since it uses as much as digits as its factorization.
1120100010251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20, while the sum is 14.
Adding to 1120100010251 its reverse (1520100010211), we get a palindrome (2640200020462).
The spelling of 1120100010251 in words is "one trillion, one hundred twenty billion, one hundred million, ten thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •