Base | Representation |
---|---|
bin | 1010000011011010… |
… | …10101101110100000 |
3 | 111221011002220012120 |
4 | 11001231111232200 |
5 | 42023211344213 |
6 | 2251324224240 |
7 | 250515621603 |
oct | 50155255640 |
9 | 14834086176 |
10 | 5397371808 |
11 | 231a748364 |
12 | 106769b080 |
13 | 68028cb3a |
14 | 392b8033a |
15 | 218c9b423 |
hex | 141b55ba0 |
5397371808 has 96 divisors (see below), whose sum is σ = 14802020352. Its totient is φ = 1720032000.
The previous prime is 5397371783. The next prime is 5397371809. The reversal of 5397371808 is 8081737935.
It is a tau number, because it is divible by the number of its divisors (96).
It is not an unprimeable number, because it can be changed into a prime (5397371809) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 236083 + ... + 257933.
It is an arithmetic number, because the mean of its divisors is an integer number (154187712).
Almost surely, 25397371808 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 5397371808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7401010176).
5397371808 is an abundant number, since it is smaller than the sum of its proper divisors (9404648544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5397371808 is a wasteful number, since it uses less digits than its factorization.
5397371808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21978 (or 21970 counting only the distinct ones).
The product of its (nonzero) digits is 1270080, while the sum is 51.
The square root of 5397371808 is about 73466.8075255758. The cubic root of 5397371808 is about 1754.1259715531.
The spelling of 5397371808 in words is "five billion, three hundred ninety-seven million, three hundred seventy-one thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •