Base | Representation |
---|---|
bin | 111011010000… |
… | …0000111111100 |
3 | 2011110020120201 |
4 | 1312200013330 |
5 | 30423031242 |
6 | 3025453244 |
7 | 525021160 |
oct | 166400774 |
9 | 64406521 |
10 | 31064572 |
11 | 16598300 |
12 | a4a1224 |
13 | 6588706 |
14 | 41a8ca0 |
15 | 2ad94b7 |
hex | 1da01fc |
31064572 has 72 divisors (see below), whose sum is σ = 69981408. Its totient is φ = 11806080.
The previous prime is 31064567. The next prime is 31064591. The reversal of 31064572 is 27546013.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 31064572.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 179478 + ... + 179650.
It is an arithmetic number, because the mean of its divisors is an integer number (971964).
Almost surely, 231064572 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 31064572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34990704).
31064572 is an abundant number, since it is smaller than the sum of its proper divisors (38916836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31064572 is a wasteful number, since it uses less digits than its factorization.
31064572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259 (or 246 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 28.
The square root of 31064572 is about 5573.5600831067. The cubic root of 31064572 is about 314.3560271254.
The spelling of 31064572 in words is "thirty-one million, sixty-four thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.006 sec. • engine limits •