Base | Representation |
---|---|
bin | 1011101010110111… |
… | …0011100111011000 |
3 | 22002022111001021210 |
4 | 2322231303213120 |
5 | 22403414220242 |
6 | 1234501503120 |
7 | 140425256232 |
oct | 27255634730 |
9 | 8068431253 |
10 | 3132570072 |
11 | 1368288295 |
12 | 735111aa0 |
13 | 3abcbca78 |
14 | 21a075252 |
15 | 13502dd9c |
hex | bab739d8 |
3132570072 has 64 divisors (see below), whose sum is σ = 8179545600. Its totient is φ = 998732160.
The previous prime is 3132570061. The next prime is 3132570079. The reversal of 3132570072 is 2700752313.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3132570079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22497 + ... + 82287.
It is an arithmetic number, because the mean of its divisors is an integer number (127805400).
Almost surely, 23132570072 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 3132570072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4089772800).
3132570072 is an abundant number, since it is smaller than the sum of its proper divisors (5046975528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3132570072 is a wasteful number, since it uses less digits than its factorization.
3132570072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59896 (or 59892 counting only the distinct ones).
The product of its (nonzero) digits is 8820, while the sum is 30.
The square root of 3132570072 is about 55969.3672646029. The cubic root of 3132570072 is about 1463.1884517922.
The spelling of 3132570072 in words is "three billion, one hundred thirty-two million, five hundred seventy thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •