Base | Representation |
---|---|
bin | 1001100001101011… |
… | …01000111100011101 |
3 | 111012102112010201000 |
4 | 10300311220330131 |
5 | 40433232210010 |
6 | 2203253540513 |
7 | 240511062453 |
oct | 46065507435 |
9 | 14172463630 |
10 | 5114335005 |
11 | 21949aa64a |
12 | ba8944739 |
13 | 636751140 |
14 | 3673449d3 |
15 | 1ededd7c0 |
hex | 130d68f1d |
5114335005 has 32 divisors (see below), whose sum is σ = 9791550720. Its totient is φ = 2517825600.
The previous prime is 5114334997. The next prime is 5114335007. The reversal of 5114335005 is 5005334115.
It is not a de Polignac number, because 5114335005 - 23 = 5114334997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 5114335005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5114335007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1455321 + ... + 1458830.
It is an arithmetic number, because the mean of its divisors is an integer number (305985960).
Almost surely, 25114335005 is an apocalyptic number.
It is an amenable number.
5114335005 is a deficient number, since it is larger than the sum of its proper divisors (4677215715).
5114335005 is a wasteful number, since it uses less digits than its factorization.
5114335005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2914178 (or 2914172 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The square root of 5114335005 is about 71514.5789682076. The cubic root of 5114335005 is about 1722.9118475542.
The spelling of 5114335005 in words is "five billion, one hundred fourteen million, three hundred thirty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •