Base | Representation |
---|---|
bin | 1010100000010110… |
… | …10111101110001000 |
3 | 112120001220001102101 |
4 | 11100023113232020 |
5 | 43022333002240 |
6 | 2331355243144 |
7 | 256524163024 |
oct | 52013275610 |
9 | 15501801371 |
10 | 5640125320 |
11 | 24347816a5 |
12 | 1114a494b4 |
13 | 6bb66607b |
14 | 3b70d1384 |
15 | 23024d39a |
hex | 1502d7b88 |
5640125320 has 128 divisors (see below), whose sum is σ = 13786848000. Its totient is φ = 2070154240.
The previous prime is 5640125317. The next prime is 5640125333. The reversal of 5640125320 is 235210465.
It is a super-2 number, since 2×56401253202 = 63622027250610204800, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4775130 + ... + 4776310.
It is an arithmetic number, because the mean of its divisors is an integer number (107709750).
Almost surely, 25640125320 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 5640125320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6893424000).
5640125320 is an abundant number, since it is smaller than the sum of its proper divisors (8146722680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5640125320 is a wasteful number, since it uses less digits than its factorization.
5640125320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1423 (or 1419 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 5640125320 is about 75100.7677723737. The cubic root of 5640125320 is about 1780.0392744775.
Adding to 5640125320 its reverse (235210465), we get a palindrome (5875335785).
The spelling of 5640125320 in words is "five billion, six hundred forty million, one hundred twenty-five thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •