Base | Representation |
---|---|
bin | 100100011100111101110… |
… | …0100100101010010001001 |
3 | 122201221200212101120011000 |
4 | 1020321323210211102021 |
5 | 1124040442243221401 |
6 | 14353321535325213 |
7 | 1024650411215421 |
oct | 110717344452211 |
9 | 18657625346130 |
10 | 5010005054601 |
11 | 1661805274128 |
12 | 68ab80680809 |
13 | 2a4597b31311 |
14 | 1346b2463481 |
15 | 8a4c5c7c186 |
hex | 48e7b925489 |
5010005054601 has 32 divisors (see below), whose sum is σ = 7436047806720. Its totient is φ = 3333788623872.
The previous prime is 5010005054573. The next prime is 5010005054609. The reversal of 5010005054601 is 1064505000105.
It is a happy number.
5010005054601 is a `hidden beast` number, since 5 + 0 + 1 + 0 + 0 + 0 + 5 + 0 + 54 + 601 = 666.
5010005054601 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5010005054601 - 27 = 5010005054473 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (5010005054609) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 55263156 + ... + 55353738.
It is an arithmetic number, because the mean of its divisors is an integer number (232376493960).
Almost surely, 25010005054601 is an apocalyptic number.
It is an amenable number.
5010005054601 is a deficient number, since it is larger than the sum of its proper divisors (2426042752119).
5010005054601 is a wasteful number, since it uses less digits than its factorization.
5010005054601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94382 (or 94376 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
The spelling of 5010005054601 in words is "five trillion, ten billion, five million, fifty-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •