Base | Representation |
---|---|
bin | 1010100000010101… |
… | …11000101110111000 |
3 | 112120001122121022100 |
4 | 11100022320232320 |
5 | 43022314422032 |
6 | 2331352423400 |
7 | 256523124000 |
oct | 52012705670 |
9 | 15501577270 |
10 | 5639998392 |
11 | 24346a52a6 |
12 | 11149a7b60 |
13 | 6bb620372 |
14 | 3b709b000 |
15 | 23022597c |
hex | 1502b8bb8 |
5639998392 has 384 divisors, whose sum is σ = 18869760000. Its totient is φ = 1519015680.
The previous prime is 5639998391. The next prime is 5639998411. The reversal of 5639998392 is 2938999365.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5639998391) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 40575459 + ... + 40575597.
It is an arithmetic number, because the mean of its divisors is an integer number (49140000).
Almost surely, 25639998392 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 5639998392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9434880000).
5639998392 is an abundant number, since it is smaller than the sum of its proper divisors (13229761608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5639998392 is a wasteful number, since it uses less digits than its factorization.
5639998392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256 (or 235 counting only the distinct ones).
The product of its digits is 28343520, while the sum is 63.
The square root of 5639998392 is about 75099.9227163384. The cubic root of 5639998392 is about 1780.0259214337.
The spelling of 5639998392 in words is "five billion, six hundred thirty-nine million, nine hundred ninety-eight thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •