Base | Representation |
---|---|
bin | 111100000000… |
… | …0001101010011 |
3 | 2012012020102222 |
4 | 1320000031103 |
5 | 31023130011 |
6 | 3042131255 |
7 | 531250445 |
oct | 170001523 |
9 | 65166388 |
10 | 31458131 |
11 | 16836a61 |
12 | a650b2b |
13 | 66958a3 |
14 | 426c495 |
15 | 2b65ddb |
hex | 1e00353 |
31458131 has 2 divisors, whose sum is σ = 31458132. Its totient is φ = 31458130.
The previous prime is 31458113. The next prime is 31458169. The reversal of 31458131 is 13185413.
Together with previous prime (31458113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (13185413) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31458131 is a prime.
It is a super-2 number, since 2×314581312 = 1979228012026322, which contains 22 as substring.
It is a Chen prime.
It is equal to p1942433 and since 31458131 and 1942433 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 31458131.
It is not a weakly prime, because it can be changed into another prime (31458191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15729065 + 15729066.
It is an arithmetic number, because the mean of its divisors is an integer number (15729066).
Almost surely, 231458131 is an apocalyptic number.
31458131 is a deficient number, since it is larger than the sum of its proper divisors (1).
31458131 is an equidigital number, since it uses as much as digits as its factorization.
31458131 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1440, while the sum is 26.
The square root of 31458131 is about 5608.7548529063. The cubic root of 31458131 is about 315.6779920957.
The spelling of 31458131 in words is "thirty-one million, four hundred fifty-eight thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •