Base | Representation |
---|---|
bin | 1110010010101110111111… |
… | …11101010111010011000101 |
3 | 11010021200102001021122000021 |
4 | 13021113133331113103011 |
5 | 13104422201434011323 |
6 | 150502431411415141 |
7 | 6422513343306313 |
oct | 711273775272305 |
9 | 133250361248007 |
10 | 31430033110213 |
11 | a018447347591 |
12 | 36374265b44b1 |
13 | 146cabb231a4a |
14 | 7a931657d0b3 |
15 | 39787990305d |
hex | 1c95dff574c5 |
31430033110213 has 2 divisors, whose sum is σ = 31430033110214. Its totient is φ = 31430033110212.
The previous prime is 31430033110199. The next prime is 31430033110243. The reversal of 31430033110213 is 31201133003413.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17610427604484 + 13819605505729 = 4196478^2 + 3717473^2 .
It is an emirp because it is prime and its reverse (31201133003413) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31430033110213 - 25 = 31430033110181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31430033110243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15715016555106 + 15715016555107.
It is an arithmetic number, because the mean of its divisors is an integer number (15715016555107).
Almost surely, 231430033110213 is an apocalyptic number.
It is an amenable number.
31430033110213 is a deficient number, since it is larger than the sum of its proper divisors (1).
31430033110213 is an equidigital number, since it uses as much as digits as its factorization.
31430033110213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 31430033110213 its reverse (31201133003413), we get a palindrome (62631166113626).
The spelling of 31430033110213 in words is "thirty-one trillion, four hundred thirty billion, thirty-three million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •