Base | Representation |
---|---|
bin | 10000011000000001110… |
… | …000111101111001011101 |
3 | 10222120121212021002100202 |
4 | 100120001300331321131 |
5 | 121414114111421323 |
6 | 2220543305033245 |
7 | 144205154030165 |
oct | 20300160757135 |
9 | 3876555232322 |
10 | 1125311045213 |
11 | 3a4272825983 |
12 | 162114485825 |
13 | 821688a8ac4 |
14 | 3c672c9b5a5 |
15 | 1e412b14d28 |
hex | 10601c3de5d |
1125311045213 has 2 divisors, whose sum is σ = 1125311045214. Its totient is φ = 1125311045212.
The previous prime is 1125311045149. The next prime is 1125311045249. The reversal of 1125311045213 is 3125401135211.
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., 884271287449 + 241039757764 = 940357^2 + 490958^2 .
It is an emirp because it is prime and its reverse (3125401135211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1125311045213 - 26 = 1125311045149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1125311045113) 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, 562655522606 + 562655522607.
It is an arithmetic number, because the mean of its divisors is an integer number (562655522607).
Almost surely, 21125311045213 is an apocalyptic number.
It is an amenable number.
1125311045213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1125311045213 is an equidigital number, since it uses as much as digits as its factorization.
1125311045213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 29.
The spelling of 1125311045213 in words is "one trillion, one hundred twenty-five billion, three hundred eleven million, forty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •