Base | Representation |
---|---|
bin | 1001111111011110… |
… | …01011100000001110 |
3 | 111211211212122221000 |
4 | 10333233023200032 |
5 | 41441230043130 |
6 | 2244143321130 |
7 | 246634536663 |
oct | 47757134016 |
9 | 14754778830 |
10 | 5364299790 |
11 | 2303009913 |
12 | 10585b01a6 |
13 | 6764807b5 |
14 | 38c611a6a |
15 | 215e17260 |
hex | 13fbcb80e |
5364299790 has 32 divisors (see below), whose sum is σ = 14304800160. Its totient is φ = 1430479872.
The previous prime is 5364299783. The next prime is 5364299797. The reversal of 5364299790 is 979924635.
It is an interprime number because it is at equal distance from previous prime (5364299783) and next prime (5364299797).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5364299797) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9933619 + ... + 9934158.
It is an arithmetic number, because the mean of its divisors is an integer number (447025005).
Almost surely, 25364299790 is an apocalyptic number.
5364299790 is an abundant number, since it is smaller than the sum of its proper divisors (8940500370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5364299790 is a wasteful number, since it uses less digits than its factorization.
5364299790 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19867793 (or 19867787 counting only the distinct ones).
The product of its (nonzero) digits is 3674160, while the sum is 54.
The square root of 5364299790 is about 73241.3803119521. The cubic root of 5364299790 is about 1750.5358674599.
The spelling of 5364299790 in words is "five billion, three hundred sixty-four million, two hundred ninety-nine thousand, seven hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •