Base | Representation |
---|---|
bin | 1001100001010001… |
… | …11010110000101110 |
3 | 111012012020201002101 |
4 | 10300220322300232 |
5 | 40431404000420 |
6 | 2203054245314 |
7 | 240440532646 |
oct | 46050726056 |
9 | 14165221071 |
10 | 5111000110 |
11 | 2193032037 |
12 | ba77b683a |
13 | 635b54228 |
14 | 366b17526 |
15 | 1eda8060a |
hex | 130a3ac2e |
5111000110 has 8 divisors (see below), whose sum is σ = 9199800216. Its totient is φ = 2044400040.
The previous prime is 5111000087. The next prime is 5111000119. The reversal of 5111000110 is 110001115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×51110001102 = 52244644248840024200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 511100011 = 5111000110 / (5 + 1 + 1 + 1 + 0 + 0 + 0 + 1 + 1 + 0).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5111000119) 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, 255549996 + ... + 255550015.
It is an arithmetic number, because the mean of its divisors is an integer number (1149975027).
Almost surely, 25111000110 is an apocalyptic number.
5111000110 is a deficient number, since it is larger than the sum of its proper divisors (4088800106).
5111000110 is a wasteful number, since it uses less digits than its factorization.
5111000110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 511100018.
The product of its (nonzero) digits is 5, while the sum is 10.
The square root of 5111000110 is about 71491.2589761853. The cubic root of 5111000110 is about 1722.5372808105.
Adding to 5111000110 its reverse (110001115), we get a palindrome (5221001225).
The spelling of 5111000110 in words is "five billion, one hundred eleven million, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •