Base | Representation |
---|---|
bin | 100101001011101001010… |
… | …1110100001010000100000 |
3 | 200002112110012210220102122 |
4 | 1022113102232201100200 |
5 | 1132211243342301102 |
6 | 14511341145203412 |
7 | 1035126540156104 |
oct | 112272256412040 |
9 | 20075405726378 |
10 | 5110251525152 |
11 | 16a02778421a4 |
12 | 6a6498a90568 |
13 | 2b0b82718b07 |
14 | 1394a2121904 |
15 | 8cde19500a2 |
hex | 4a5d2ba1420 |
5110251525152 has 24 divisors (see below), whose sum is σ = 10385349875712. Its totient is φ = 2472702350400.
The previous prime is 5110251525149. The next prime is 5110251525173. The reversal of 5110251525152 is 2515251520115.
It is a super-2 number, since 2×51102515251522 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 2575730624 + ... + 2575732607.
It is an arithmetic number, because the mean of its divisors is an integer number (432722911488).
Almost surely, 25110251525152 is an apocalyptic number.
It is an amenable number.
5110251525152 is an abundant number, since it is smaller than the sum of its proper divisors (5275098350560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5110251525152 is a wasteful number, since it uses less digits than its factorization.
5110251525152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5151463272 (or 5151463264 counting only the distinct ones).
The product of its (nonzero) digits is 25000, while the sum is 35.
The spelling of 5110251525152 in words is "five trillion, one hundred ten billion, two hundred fifty-one million, five hundred twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •