Base | Representation |
---|---|
bin | 1010100100010110… |
… | …01110000001000000 |
3 | 112122101221202220211 |
4 | 11102023032001000 |
5 | 43104422440000 |
6 | 2334553443504 |
7 | 260412100330 |
oct | 52213160100 |
9 | 15571852824 |
10 | 5673640000 |
11 | 2451692786 |
12 | 1124110594 |
13 | 6c559ba42 |
14 | 3bb7370c0 |
15 | 23316d7ba |
hex | 1522ce040 |
5673640000 has 280 divisors, whose sum is σ = 16796723328. Its totient is φ = 1858560000.
The previous prime is 5673639973. The next prime is 5673640019. The reversal of 5673640000 is 463765.
It is a tau number, because it is divible by the number of its divisors (280).
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 39 ways as a sum of consecutive naturals, for example, 6439560 + ... + 6440440.
Almost surely, 25673640000 is an apocalyptic number.
5673640000 is a gapful number since it is divisible by the number (50) 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 5673640000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8398361664).
5673640000 is an abundant number, since it is smaller than the sum of its proper divisors (11123083328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5673640000 is an equidigital number, since it uses as much as digits as its factorization.
5673640000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 943 (or 918 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 31.
The square root of 5673640000 is about 75323.5686886913. The cubic root of 5673640000 is about 1783.5580893150.
The spelling of 5673640000 in words is "five billion, six hundred seventy-three million, six hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •