Base | Representation |
---|---|
bin | 1110000110111001000101… |
… | …10001101100000111100001 |
3 | 11001211210010102111020011121 |
4 | 13003130202301230013201 |
5 | 13031240333322330423 |
6 | 145551455153412241 |
7 | 6351230065014322 |
oct | 703344261540741 |
9 | 131753112436147 |
10 | 31023132230113 |
11 | 99809224108a1 |
12 | 35905a826a081 |
13 | 1440612cb37ca |
14 | 793755aa2449 |
15 | 38beb226e45d |
hex | 1c3722c6c1e1 |
31023132230113 has 2 divisors, whose sum is σ = 31023132230114. Its totient is φ = 31023132230112.
The previous prime is 31023132230089. The next prime is 31023132230201. The reversal of 31023132230113 is 31103223132013.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23625510129664 + 7397622100449 = 4860608^2 + 2719857^2 .
It is an emirp because it is prime and its reverse (31103223132013) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31023132230113 is a prime.
It is not a weakly prime, because it can be changed into another prime (31023132237113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15511566115056 + 15511566115057.
It is an arithmetic number, because the mean of its divisors is an integer number (15511566115057).
Almost surely, 231023132230113 is an apocalyptic number.
It is an amenable number.
31023132230113 is a deficient number, since it is larger than the sum of its proper divisors (1).
31023132230113 is an equidigital number, since it uses as much as digits as its factorization.
31023132230113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 31023132230113 its reverse (31103223132013), we get a palindrome (62126355362126).
The spelling of 31023132230113 in words is "thirty-one trillion, twenty-three billion, one hundred thirty-two million, two hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •