Base | Representation |
---|---|
bin | 1110001001100001000010… |
… | …01100011110010101100001 |
3 | 11002011101212101002001111022 |
4 | 13010300201030132111201 |
5 | 13034230014300312322 |
6 | 150101130330055225 |
7 | 6360601402343126 |
oct | 704604114362541 |
9 | 132141771061438 |
10 | 31113300010337 |
11 | 9a06092808726 |
12 | 35a5b7127a515 |
13 | 1448c827bb90c |
14 | 797c6ad9674d |
15 | 38e4dd1dd942 |
hex | 1c4c2131e561 |
31113300010337 has 2 divisors, whose sum is σ = 31113300010338. Its totient is φ = 31113300010336.
The previous prime is 31113300010297. The next prime is 31113300010339. The reversal of 31113300010337 is 73301000331113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27213844122721 + 3899455887616 = 5216689^2 + 1974704^2 .
It is a cyclic number.
It is not a de Polignac number, because 31113300010337 - 244 = 13521113965921 is a prime.
Together with 31113300010339, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (31113300010339) 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, 15556650005168 + 15556650005169.
It is an arithmetic number, because the mean of its divisors is an integer number (15556650005169).
Almost surely, 231113300010337 is an apocalyptic number.
It is an amenable number.
31113300010337 is a deficient number, since it is larger than the sum of its proper divisors (1).
31113300010337 is an equidigital number, since it uses as much as digits as its factorization.
31113300010337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1701, while the sum is 26.
The spelling of 31113300010337 in words is "thirty-one trillion, one hundred thirteen billion, three hundred million, ten thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.229 sec. • engine limits •