Base | Representation |
---|---|
bin | 100100110001001000100… |
… | …0010111110000111001000 |
3 | 122220002111012201111212112 |
4 | 1021202101002332013020 |
5 | 1130243142120440422 |
6 | 14425243314201452 |
7 | 1031042566625030 |
oct | 111422102760710 |
9 | 18802435644775 |
10 | 5053315015112 |
11 | 167910a64a521 |
12 | 697448b83288 |
13 | 2a86aa8727a0 |
14 | 1368204808c0 |
15 | 8b6ad132ee2 |
hex | 498910be1c8 |
5053315015112 has 32 divisors (see below), whose sum is σ = 11661496190400. Its totient is φ = 1999113632064.
The previous prime is 5053315015003. The next prime is 5053315015117. The reversal of 5053315015112 is 2115105133505.
It is not an unprimeable number, because it can be changed into a prime (5053315015117) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 3470682662 + ... + 3470684117.
It is an arithmetic number, because the mean of its divisors is an integer number (364421755950).
Almost surely, 25053315015112 is an apocalyptic number.
5053315015112 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5053315015112 is an abundant number, since it is smaller than the sum of its proper divisors (6608181175288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5053315015112 is a wasteful number, since it uses less digits than its factorization.
5053315015112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6941366805 (or 6941366801 counting only the distinct ones).
The product of its (nonzero) digits is 11250, while the sum is 32.
The spelling of 5053315015112 in words is "five trillion, fifty-three billion, three hundred fifteen million, fifteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •