Base | Representation |
---|---|
bin | 100101010000100000111… |
… | …0011111111100010111101 |
3 | 200010112102202011212010102 |
4 | 1022201001303333202331 |
5 | 1132344201010244001 |
6 | 14520230335050445 |
7 | 1035646563511502 |
oct | 112410163774275 |
9 | 20115382155112 |
10 | 5120705165501 |
11 | 16a4751629992 |
12 | 6a8515970a25 |
13 | 2b1b5a3a8c13 |
14 | 139bb460d4a9 |
15 | 8d304569e6b |
hex | 4a841cff8bd |
5120705165501 has 4 divisors (see below), whose sum is σ = 5132369642400. Its totient is φ = 5109040688604.
The previous prime is 5120705165497. The next prime is 5120705165551. The reversal of 5120705165501 is 1055615070215.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5120705165501 - 22 = 5120705165497 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5120705165551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5832237791 + ... + 5832238668.
It is an arithmetic number, because the mean of its divisors is an integer number (1283092410600).
Almost surely, 25120705165501 is an apocalyptic number.
It is an amenable number.
5120705165501 is a deficient number, since it is larger than the sum of its proper divisors (11664476899).
5120705165501 is a wasteful number, since it uses less digits than its factorization.
5120705165501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11664476898.
The product of its (nonzero) digits is 52500, while the sum is 38.
The spelling of 5120705165501 in words is "five trillion, one hundred twenty billion, seven hundred five million, one hundred sixty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •