Base | Representation |
---|---|
bin | 111011010111… |
… | …0111000011111 |
3 | 2011120022111122 |
4 | 1312232320133 |
5 | 30432000043 |
6 | 3031041155 |
7 | 525362336 |
oct | 166567037 |
9 | 64508448 |
10 | 31125023 |
11 | 16629766 |
12 | a5101bb |
13 | 65aa097 |
14 | 41c2d1d |
15 | 2aec368 |
hex | 1daee1f |
31125023 has 4 divisors (see below), whose sum is σ = 32129088. Its totient is φ = 30120960.
The previous prime is 31125007. The next prime is 31125047. The reversal of 31125023 is 32052113.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32052113 = 2029 ⋅15797.
It is a cyclic number.
It is not a de Polignac number, because 31125023 - 24 = 31125007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31124992 and 31125010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31125823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 501986 + ... + 502047.
It is an arithmetic number, because the mean of its divisors is an integer number (8032272).
Almost surely, 231125023 is an apocalyptic number.
31125023 is a deficient number, since it is larger than the sum of its proper divisors (1004065).
31125023 is a wasteful number, since it uses less digits than its factorization.
31125023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1004064.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 31125023 is about 5578.9804624143. The cubic root of 31125023 is about 314.5598050597.
Adding to 31125023 its reverse (32052113), we get a palindrome (63177136).
The spelling of 31125023 in words is "thirty-one million, one hundred twenty-five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •