Base | Representation |
---|---|
bin | 110011011101011101… |
… | …0001100101101111101 |
3 | 101120020122001201020210 |
4 | 1212322322030231331 |
5 | 3302311030013041 |
6 | 122433444503033 |
7 | 10661353336620 |
oct | 1467272145575 |
9 | 346218051223 |
10 | 110510001021 |
11 | 4295a018462 |
12 | 195016aaa79 |
13 | a562074164 |
14 | 54c4c1ddb7 |
15 | 2d1bc89016 |
hex | 19bae8cb7d |
110510001021 has 16 divisors (see below), whose sum is σ = 171156787328. Its totient is φ = 62113348800.
The previous prime is 110510001001. The next prime is 110510001037. The reversal of 110510001021 is 120100015011.
It is not a de Polignac number, because 110510001021 - 213 = 110509992829 is a prime.
It is a super-2 number, since 2×1105100010212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110510000988 and 110510001006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110510001001) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 43132990 + ... + 43135551.
It is an arithmetic number, because the mean of its divisors is an integer number (10697299208).
Almost surely, 2110510001021 is an apocalyptic number.
It is an amenable number.
110510001021 is a deficient number, since it is larger than the sum of its proper divisors (60646786307).
110510001021 is an equidigital number, since it uses as much as digits as its factorization.
110510001021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86268612.
The product of its (nonzero) digits is 10, while the sum is 12.
Adding to 110510001021 its reverse (120100015011), we get a palindrome (230610016032).
The spelling of 110510001021 in words is "one hundred ten billion, five hundred ten million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •