Base | Representation |
---|---|
bin | 1110001100011100111111… |
… | …00011000100110110011001 |
3 | 11002112001022112221112110012 |
4 | 13012032133203010312121 |
5 | 13042403142223043111 |
6 | 150215335111131305 |
7 | 6401103035143301 |
oct | 706163743046631 |
9 | 132461275845405 |
10 | 31214204112281 |
11 | 9a44962517a13 |
12 | 3601631973b35 |
13 | 14556436ccb08 |
14 | 79cac0120601 |
15 | 391e469b548b |
hex | 1c639f8c4d99 |
31214204112281 has 2 divisors, whose sum is σ = 31214204112282. Its totient is φ = 31214204112280.
The previous prime is 31214204112257. The next prime is 31214204112317. The reversal of 31214204112281 is 18221140241213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27172335118681 + 4041868993600 = 5212709^2 + 2010440^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31214204112281 is a prime.
It is a super-2 number, since 2×312142041122812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31214204712281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15607102056140 + 15607102056141.
It is an arithmetic number, because the mean of its divisors is an integer number (15607102056141).
Almost surely, 231214204112281 is an apocalyptic number.
It is an amenable number.
31214204112281 is a deficient number, since it is larger than the sum of its proper divisors (1).
31214204112281 is an equidigital number, since it uses as much as digits as its factorization.
31214204112281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6144, while the sum is 32.
Adding to 31214204112281 its reverse (18221140241213), we get a palindrome (49435344353494).
The spelling of 31214204112281 in words is "thirty-one trillion, two hundred fourteen billion, two hundred four million, one hundred twelve thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •