Base | Representation |
---|---|
bin | 100101001100000001001… |
… | …0100110101111101001001 |
3 | 200002121111212110201221100 |
4 | 1022120002110311331021 |
5 | 1132214412311204203 |
6 | 14511552313332013 |
7 | 1035155405020215 |
oct | 112300224657511 |
9 | 20077455421840 |
10 | 5111050100553 |
11 | 16a064759a771 |
12 | 6a6680407009 |
13 | 2b0c7bcc0437 |
14 | 13953a1d9945 |
15 | 8ce3bae4ea3 |
hex | 4a602535f49 |
5111050100553 has 24 divisors (see below), whose sum is σ = 7530468920000. Its totient is φ = 3339643548384.
The previous prime is 5111050100551. The next prime is 5111050100567. The reversal of 5111050100553 is 3550010501115.
5111050100553 is a `hidden beast` number, since 5 + 1 + 1 + 1 + 0 + 5 + 0 + 100 + 553 = 666.
It is not a de Polignac number, because 5111050100553 - 21 = 5111050100551 is a prime.
It is a super-2 number, since 2×51110501005532 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5111050100551) 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 23 ways as a sum of consecutive naturals, for example, 21176578 + ... + 21416571.
Almost surely, 25111050100553 is an apocalyptic number.
It is an amenable number.
5111050100553 is a deficient number, since it is larger than the sum of its proper divisors (2419418819447).
5111050100553 is a wasteful number, since it uses less digits than its factorization.
5111050100553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42593421 (or 42593418 counting only the distinct ones).
The product of its (nonzero) digits is 1875, while the sum is 27.
Adding to 5111050100553 its reverse (3550010501115), we get a palindrome (8661060601668).
The spelling of 5111050100553 in words is "five trillion, one hundred eleven billion, fifty million, one hundred thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •