Base | Representation |
---|---|
bin | 10010001111000011100… |
… | …000010011110111000011 |
3 | 11102210111202220121011101 |
4 | 102033003200103313003 |
5 | 131012340032311321 |
6 | 2355401234155231 |
7 | 156351241042645 |
oct | 22170340236703 |
9 | 4383452817141 |
10 | 1253115510211 |
11 | 443497045074 |
12 | 182a41a22b17 |
13 | 912259533a6 |
14 | 4491892c895 |
15 | 228e2d3e791 |
hex | 123c3813dc3 |
1253115510211 has 2 divisors, whose sum is σ = 1253115510212. Its totient is φ = 1253115510210.
The previous prime is 1253115510197. The next prime is 1253115510221. The reversal of 1253115510211 is 1120155113521.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1253115510211 - 215 = 1253115477443 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1253115510211.
It is not a weakly prime, because it can be changed into another prime (1253115510221) 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, 626557755105 + 626557755106.
It is an arithmetic number, because the mean of its divisors is an integer number (626557755106).
Almost surely, 21253115510211 is an apocalyptic number.
1253115510211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1253115510211 is an equidigital number, since it uses as much as digits as its factorization.
1253115510211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1500, while the sum is 28.
The spelling of 1253115510211 in words is "one trillion, two hundred fifty-three billion, one hundred fifteen million, five hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •