Base | Representation |
---|---|
bin | 11101000101001010… |
… | …111000100010101101 |
3 | 2222121010211011011022 |
4 | 131011022320202231 |
5 | 1002422131031023 |
6 | 22202241303525 |
7 | 2153535156104 |
oct | 350512704255 |
9 | 88533734138 |
10 | 31225252013 |
11 | 12273927aaa |
12 | 6075334ba5 |
13 | 2c3818b3a7 |
14 | 172306d03b |
15 | c2b4a17c8 |
hex | 7452b88ad |
31225252013 has 2 divisors, whose sum is σ = 31225252014. Its totient is φ = 31225252012.
The previous prime is 31225251977. The next prime is 31225252031. The reversal of 31225252013 is 31025252213.
It is a happy number.
Together with next prime (31225252031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25040530564 + 6184721449 = 158242^2 + 78643^2 .
It is an emirp because it is prime and its reverse (31025252213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31225252013 - 212 = 31225247917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31225252043) 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, 15612626006 + 15612626007.
It is an arithmetic number, because the mean of its divisors is an integer number (15612626007).
Almost surely, 231225252013 is an apocalyptic number.
It is an amenable number.
31225252013 is a deficient number, since it is larger than the sum of its proper divisors (1).
31225252013 is an equidigital number, since it uses as much as digits as its factorization.
31225252013 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 26.
The spelling of 31225252013 in words is "thirty-one billion, two hundred twenty-five million, two hundred fifty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •