Base | Representation |
---|---|
bin | 1100001110100001… |
… | …00011010100000000 |
3 | 121221110202110021110 |
4 | 12013100203110000 |
5 | 101420420333100 |
6 | 3003210123320 |
7 | 321445015650 |
oct | 60720432400 |
9 | 17843673243 |
10 | 6564230400 |
11 | 2869378502 |
12 | 1332420540 |
13 | 807c4c500 |
14 | 463b24360 |
15 | 28643c250 |
hex | 187423500 |
6564230400 has 972 divisors, whose sum is σ = 28478823072. Its totient is φ = 1303511040.
The previous prime is 6564230363. The next prime is 6564230441. The reversal of 6564230400 is 40324656.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
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 107 ways as a sum of consecutive naturals, for example, 386131192 + ... + 386131208.
Almost surely, 26564230400 is an apocalyptic number.
6564230400 is a gapful number since it is divisible by the number (60) 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 6564230400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14239411536).
6564230400 is an abundant number, since it is smaller than the sum of its proper divisors (21914592672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6564230400 is a wasteful number, since it uses less digits than its factorization.
6564230400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96 (or 47 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
The square root of 6564230400 is about 81019.9382868193. The cubic root of 6564230400 is about 1872.3826378327.
The spelling of 6564230400 in words is "six billion, five hundred sixty-four million, two hundred thirty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.369 sec. • engine limits •