Base | Representation |
---|---|
bin | 111011001000… |
… | …1011011101101 |
3 | 2011100012001000 |
4 | 1312101123231 |
5 | 30414120042 |
6 | 3024310513 |
7 | 524350554 |
oct | 166213355 |
9 | 64305030 |
10 | 31004397 |
11 | 16557076 |
12 | a472439 |
13 | 65671c8 |
14 | 4190d9b |
15 | 2ac674c |
hex | 1d916ed |
31004397 has 8 divisors (see below), whose sum is σ = 45932480. Its totient is φ = 20669580.
The previous prime is 31004387. The next prime is 31004423. The reversal of 31004397 is 79340013.
It is not a de Polignac number, because 31004397 - 212 = 31000301 is a prime.
It is a super-2 number, since 2×310043972 = 1922545266667218, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1148311 = 31004397 / (3 + 1 + 0 + 0 + 4 + 3 + 9 + 7).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 31004397.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31004387) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 574129 + ... + 574182.
It is an arithmetic number, because the mean of its divisors is an integer number (5741560).
Almost surely, 231004397 is an apocalyptic number.
It is an amenable number.
31004397 is a deficient number, since it is larger than the sum of its proper divisors (14928083).
31004397 is a wasteful number, since it uses less digits than its factorization.
31004397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1148320 (or 1148314 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
The square root of 31004397 is about 5568.1592110858. The cubic root of 31004397 is about 314.1529168496.
The spelling of 31004397 in words is "thirty-one million, four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •