Base | Representation |
---|---|
bin | 100100111010000111100… |
… | …0111110010001101101101 |
3 | 122221221021220210010202210 |
4 | 1021310033013302031231 |
5 | 1131102201134404001 |
6 | 14442154102241033 |
7 | 1032325002135303 |
oct | 111641707621555 |
9 | 18857256703683 |
10 | 5072610075501 |
11 | 1686311165a21 |
12 | 69b132a26179 |
13 | 2aa46419b897 |
14 | 137730ca4273 |
15 | 8be3c052dd6 |
hex | 49d0f1f236d |
5072610075501 has 8 divisors (see below), whose sum is σ = 6858740384064. Its totient is φ = 3334109908640.
The previous prime is 5072610075383. The next prime is 5072610075503. The reversal of 5072610075501 is 1055700162705.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5072610075501 - 27 = 5072610075373 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5072610075501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5072610075503) 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 7 ways as a sum of consecutive naturals, for example, 11907535176 + ... + 11907535601.
It is an arithmetic number, because the mean of its divisors is an integer number (857342548008).
Almost surely, 25072610075501 is an apocalyptic number.
It is an amenable number.
5072610075501 is a deficient number, since it is larger than the sum of its proper divisors (1786130308563).
5072610075501 is a wasteful number, since it uses less digits than its factorization.
5072610075501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23815070851.
The product of its (nonzero) digits is 73500, while the sum is 39.
The spelling of 5072610075501 in words is "five trillion, seventy-two billion, six hundred ten million, seventy-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •