Base | Representation |
---|---|
bin | 100101000110111011001… |
… | …0011110111100011001001 |
3 | 200001120021111210221100121 |
4 | 1022031312103313203021 |
5 | 1132030011420200410 |
6 | 14502543024503241 |
7 | 1034320336033510 |
oct | 112156623674311 |
9 | 20046244727317 |
10 | 5100111100105 |
11 | 1696a4383582a |
12 | 6a4528a7ab21 |
13 | 2acc279029c8 |
14 | 138bbd487677 |
15 | 8c9eb5a49da |
hex | 4a3764f78c9 |
5100111100105 has 8 divisors (see below), whose sum is σ = 6994438080192. Its totient is φ = 3497219040048.
The previous prime is 5100111100067. The next prime is 5100111100111. The reversal of 5100111100105 is 5010011110015.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5100111100105 - 229 = 5099574229193 is a prime.
It is a super-2 number, since 2×51001111001052 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72858729967 + ... + 72858730036.
It is an arithmetic number, because the mean of its divisors is an integer number (874304760024).
Almost surely, 25100111100105 is an apocalyptic number.
It is an amenable number.
5100111100105 is a deficient number, since it is larger than the sum of its proper divisors (1894326980087).
5100111100105 is a wasteful number, since it uses less digits than its factorization.
5100111100105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145717460015.
The product of its (nonzero) digits is 25, while the sum is 16.
It can be divided in two parts, 510011110010 and 5, that added together give a palindrome (510011110015).
The spelling of 5100111100105 in words is "five trillion, one hundred billion, one hundred eleven million, one hundred thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •