Base | Representation |
---|---|
bin | 111100000000… |
… | …0101100011101 |
3 | 2012012100011211 |
4 | 1320000230131 |
5 | 31023211000 |
6 | 3042144421 |
7 | 531256324 |
oct | 170005435 |
9 | 65170154 |
10 | 31460125 |
11 | 16838504 |
12 | a652111 |
13 | 6696778 |
14 | 426d0bb |
15 | 2b667ba |
hex | 1e00b1d |
31460125 has 16 divisors (see below), whose sum is σ = 39639600. Its totient is φ = 24926400.
The previous prime is 31460063. The next prime is 31460129. The reversal of 31460125 is 52106413.
It can be written as a sum of positive squares in 8 ways, for example, as 3136441 + 28323684 = 1771^2 + 5322^2 .
It is a de Polignac number, because none of the positive numbers 2k-31460125 is a prime.
It is a nialpdrome in base 12.
It is a junction number, because it is equal to n+sod(n) for n = 31460096 and 31460105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31460129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12471 + ... + 14779.
It is an arithmetic number, because the mean of its divisors is an integer number (2477475).
Almost surely, 231460125 is an apocalyptic number.
It is an amenable number.
31460125 is a deficient number, since it is larger than the sum of its proper divisors (8179475).
31460125 is a wasteful number, since it uses less digits than its factorization.
31460125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2433 (or 2423 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 31460125 is about 5608.9326079032. The cubic root of 31460125 is about 315.6846617928.
Adding to 31460125 its reverse (52106413), we get a palindrome (83566538).
The spelling of 31460125 in words is "thirty-one million, four hundred sixty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •