Base | Representation |
---|---|
bin | 110011011101011101… |
… | …0001100011110001101 |
3 | 101120020122001122212110 |
4 | 1212322322030132031 |
5 | 3302311030000023 |
6 | 122433444454233 |
7 | 10661353333650 |
oct | 1467272143615 |
9 | 346218048773 |
10 | 110510000013 |
11 | 4295a017726 |
12 | 195016aa379 |
13 | a56207386a |
14 | 54c4c1d897 |
15 | 2d1bc88a93 |
hex | 19bae8c78d |
110510000013 has 8 divisors (see below), whose sum is σ = 168396190528. Its totient is φ = 63148571424.
The previous prime is 110510000011. The next prime is 110510000017. The reversal of 110510000013 is 310000015011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110510000013 - 21 = 110510000011 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110510000011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2631190456 + ... + 2631190497.
It is an arithmetic number, because the mean of its divisors is an integer number (21049523816).
Almost surely, 2110510000013 is an apocalyptic number.
It is an amenable number.
110510000013 is a deficient number, since it is larger than the sum of its proper divisors (57886190515).
110510000013 is an equidigital number, since it uses as much as digits as its factorization.
110510000013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5262380963.
The product of its (nonzero) digits is 15, while the sum is 12.
Adding to 110510000013 its reverse (310000015011), we get a palindrome (420510015024).
The spelling of 110510000013 in words is "one hundred ten billion, five hundred ten million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •