Base | Representation |
---|---|
bin | 1001011010100000… |
… | …00100111100001100 |
3 | 111001020021202101120 |
4 | 10231100010330030 |
5 | 40322331002211 |
6 | 2153304040540 |
7 | 236150423211 |
oct | 45520047414 |
9 | 14036252346 |
10 | 5054156556 |
11 | 2163a37699 |
12 | b90763150 |
13 | 627140ba7 |
14 | 35d35bb08 |
15 | 1e8aa2d06 |
hex | 12d404f0c |
5054156556 has 48 divisors (see below), whose sum is σ = 11916374400. Its totient is φ = 1667134080.
The previous prime is 5054156531. The next prime is 5054156557. The reversal of 5054156556 is 6556514505.
It is a super-2 number, since 2×50541565562 = 51088996985115562272, which contains 22 as substring.
It is a hoax number, since the sum of its digits (42) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (5054156557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1656120 + ... + 1659168.
It is an arithmetic number, because the mean of its divisors is an integer number (248257800).
Almost surely, 25054156556 is an apocalyptic number.
It is an amenable number.
5054156556 is an abundant number, since it is smaller than the sum of its proper divisors (6862217844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5054156556 is a wasteful number, since it uses less digits than its factorization.
5054156556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4454 (or 4452 counting only the distinct ones).
The product of its (nonzero) digits is 450000, while the sum is 42.
The square root of 5054156556 is about 71092.5914283619. The cubic root of 5054156556 is about 1716.1275504105.
The spelling of 5054156556 in words is "five billion, fifty-four million, one hundred fifty-six thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •