Base | Representation |
---|---|
bin | 1110001100101111100110… |
… | …10111111001100001000101 |
3 | 11002120000010012201201102021 |
4 | 13012113303113321201011 |
5 | 13043034130300344023 |
6 | 150224111042243141 |
7 | 6401605536206122 |
oct | 706276327714105 |
9 | 132500105651367 |
10 | 31224200403013 |
11 | 9a49122129112 |
12 | 36035616564b1 |
13 | 14565776bbb47 |
14 | 79d38b999749 |
15 | 39232e38e35d |
hex | 1c65f35f9845 |
31224200403013 has 2 divisors, whose sum is σ = 31224200403014. Its totient is φ = 31224200403012.
The previous prime is 31224200402987. The next prime is 31224200403061. The reversal of 31224200403013 is 31030400242213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29216543784289 + 2007656618724 = 5405233^2 + 1416918^2 .
It is an emirp because it is prime and its reverse (31030400242213) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31224200403013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31224200403713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15612100201506 + 15612100201507.
It is an arithmetic number, because the mean of its divisors is an integer number (15612100201507).
Almost surely, 231224200403013 is an apocalyptic number.
It is an amenable number.
31224200403013 is a deficient number, since it is larger than the sum of its proper divisors (1).
31224200403013 is an equidigital number, since it uses as much as digits as its factorization.
31224200403013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 31224200403013 its reverse (31030400242213), we get a palindrome (62254600645226).
The spelling of 31224200403013 in words is "thirty-one trillion, two hundred twenty-four billion, two hundred million, four hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •