Base | Representation |
---|---|
bin | 111011101110… |
… | …0000111000000 |
3 | 2011220201121201 |
4 | 1313130013000 |
5 | 31003412042 |
6 | 3035030544 |
7 | 530063410 |
oct | 167340700 |
9 | 64821551 |
10 | 31310272 |
11 | 16745964 |
12 | a59b454 |
13 | 66434b6 |
14 | 4230640 |
15 | 2b371b7 |
hex | 1ddc1c0 |
31310272 has 56 divisors (see below), whose sum is σ = 72566784. Its totient is φ = 13124352.
The previous prime is 31310267. The next prime is 31310281. The reversal of 31310272 is 27201313.
It is a tau number, because it is divible by the number of its divisors (56).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20313 + ... + 21799.
Almost surely, 231310272 is an apocalyptic number.
31310272 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 31310272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36283392).
31310272 is an abundant number, since it is smaller than the sum of its proper divisors (41256512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31310272 is a wasteful number, since it uses less digits than its factorization.
31310272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1553 (or 1543 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 19.
The square root of 31310272 is about 5595.5582384602. The cubic root of 31310272 is about 315.1826336554.
Adding to 31310272 its reverse (27201313), we get a palindrome (58511585).
It can be divided in two parts, 313 and 10272, that added together give a triangular number (10585 = T145).
The spelling of 31310272 in words is "thirty-one million, three hundred ten thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •