Base | Representation |
---|---|
bin | 100101001001101101111… |
… | …1000000101100000001001 |
3 | 200002010202120220201000220 |
4 | 1022103123320011200021 |
5 | 1132124303133414203 |
6 | 14505414203220253 |
7 | 1034622111252225 |
oct | 112233370054011 |
9 | 20063676821026 |
10 | 5106110060553 |
11 | 1699542016587 |
12 | 6a5721b17689 |
13 | 2b06726c6548 |
14 | 1391cc0a5785 |
15 | 8cc4d084653 |
hex | 4a4dbe05809 |
5106110060553 has 4 divisors (see below), whose sum is σ = 6808146747408. Its totient is φ = 3404073373700.
The previous prime is 5106110060551. The next prime is 5106110060567. The reversal of 5106110060553 is 3550600116015.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5106110060553 - 21 = 5106110060551 is a prime.
It is a super-2 number, since 2×51061100605532 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5106110060551) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 851018343423 + ... + 851018343428.
It is an arithmetic number, because the mean of its divisors is an integer number (1702036686852).
Almost surely, 25106110060553 is an apocalyptic number.
It is an amenable number.
5106110060553 is a deficient number, since it is larger than the sum of its proper divisors (1702036686855).
5106110060553 is a wasteful number, since it uses less digits than its factorization.
5106110060553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1702036686854.
The product of its (nonzero) digits is 13500, while the sum is 33.
Adding to 5106110060553 its reverse (3550600116015), we get a palindrome (8656710176568).
The spelling of 5106110060553 in words is "five trillion, one hundred six billion, one hundred ten million, sixty thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •