Base | Representation |
---|---|
bin | 1001111100100110… |
… | …11001001111010101 |
3 | 111210011121020110102 |
4 | 10332103121033111 |
5 | 41414100120210 |
6 | 2241523503445 |
7 | 246223165226 |
oct | 47623311725 |
9 | 14704536412 |
10 | 5340238805 |
11 | 22a0475500 |
12 | 1050527b85 |
13 | 6714a7b25 |
14 | 38934b24d |
15 | 213c62ea5 |
hex | 13e4d93d5 |
5340238805 has 18 divisors (see below), whose sum is σ = 7046190774. Its totient is φ = 3882502800.
The previous prime is 5340238793. The next prime is 5340238811. The reversal of 5340238805 is 5088320435.
It can be written as a sum of positive squares in only one way, i.e., 4272191044 + 1068047761 = 65362^2 + 32681^2 .
It is not a de Polignac number, because 5340238805 - 26 = 5340238741 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 17 ways as a sum of consecutive naturals, for example, 1795970 + ... + 1798940.
It is an arithmetic number, because the mean of its divisors is an integer number (391455043).
Almost surely, 25340238805 is an apocalyptic number.
5340238805 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5340238805 is a deficient number, since it is larger than the sum of its proper divisors (1705951969).
5340238805 is an frugal number, since it uses more digits than its factorization.
5340238805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5969 (or 2987 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 38.
The square root of 5340238805 is about 73076.9375726706. The cubic root of 5340238805 is about 1747.9146649034.
The spelling of 5340238805 in words is "five billion, three hundred forty million, two hundred thirty-eight thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •