Base | Representation |
---|---|
bin | 100100011000110100110… |
… | …1000110000110111101000 |
3 | 122201002202020201200100110 |
4 | 1020301221220300313220 |
5 | 1123414240220214102 |
6 | 14345251414134320 |
7 | 1024214162345652 |
oct | 110615150606750 |
9 | 18632666650313 |
10 | 5001114226152 |
11 | 1658a62669120 |
12 | 6892bb0513a0 |
13 | 2a37abb86295 |
14 | 1340ab7496d2 |
15 | 8a15546786c |
hex | 48c69a30de8 |
5001114226152 has 32 divisors (see below), whose sum is σ = 13639402435680. Its totient is φ = 1515489159360.
The previous prime is 5001114226117. The next prime is 5001114226153. The reversal of 5001114226152 is 2516224111005.
It is a super-2 number, since 2×50011142261522 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5001114226153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9471806983 + ... + 9471807510.
It is an arithmetic number, because the mean of its divisors is an integer number (426231326115).
Almost surely, 25001114226152 is an apocalyptic number.
It is an amenable number.
5001114226152 is an abundant number, since it is smaller than the sum of its proper divisors (8638288209528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5001114226152 is a wasteful number, since it uses less digits than its factorization.
5001114226152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18943614513 (or 18943614509 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 5001114226152 its reverse (2516224111005), we get a palindrome (7517338337157).
The spelling of 5001114226152 in words is "five trillion, one billion, one hundred fourteen million, two hundred twenty-six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •