Base | Representation |
---|---|
bin | 111011001001… |
… | …1000110000001 |
3 | 2011100112101000 |
4 | 1312103012001 |
5 | 30414324301 |
6 | 3024402213 |
7 | 524406444 |
oct | 166230601 |
9 | 64315330 |
10 | 31011201 |
11 | 165611a1 |
12 | a476369 |
13 | 656a330 |
14 | 419365b |
15 | 2ac8786 |
hex | 1d93181 |
31011201 has 32 divisors (see below), whose sum is σ = 50440320. Its totient is φ = 18712512.
The previous prime is 31011193. The next prime is 31011209. The reversal of 31011201 is 10211013.
It is an interprime number because it is at equal distance from previous prime (31011193) and next prime (31011209).
It is not a de Polignac number, because 31011201 - 23 = 31011193 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (31011209) 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 31 ways as a sum of consecutive naturals, for example, 17770 + ... + 19436.
It is an arithmetic number, because the mean of its divisors is an integer number (1576260).
Almost surely, 231011201 is an apocalyptic number.
It is an amenable number.
31011201 is a deficient number, since it is larger than the sum of its proper divisors (19429119).
31011201 is a wasteful number, since it uses less digits than its factorization.
31011201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1742 (or 1736 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 31011201 is about 5568.7701514787. The cubic root of 31011201 is about 314.1758957420.
Adding to 31011201 its reverse (10211013), we get a palindrome (41222214).
It can be divided in two parts, 3101120 and 1, that added together give a square (3101121 = 17612).
The spelling of 31011201 in words is "thirty-one million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •