Base | Representation |
---|---|
bin | 110011010001010011… |
… | …1000001101111000001 |
3 | 101112012012221110220222 |
4 | 1212202213001233001 |
5 | 3300442143301423 |
6 | 122325202512425 |
7 | 10645303203440 |
oct | 1464247015701 |
9 | 345165843828 |
10 | 110102322113 |
11 | 4276a988243 |
12 | 19409065715 |
13 | a4c8774634 |
14 | 5486a1ad57 |
15 | 2ce60aa3c8 |
hex | 19a29c1bc1 |
110102322113 has 8 divisors (see below), whose sum is σ = 130170233280. Its totient is φ = 91119162960.
The previous prime is 110102322107. The next prime is 110102322133. The reversal of 110102322113 is 311223201011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110102322113 - 210 = 110102321089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110102322091 and 110102322100.
It is not an unprimeable number, because it can be changed into a prime (110102322103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 271187783 + ... + 271188188.
It is an arithmetic number, because the mean of its divisors is an integer number (16271279160).
Almost surely, 2110102322113 is an apocalyptic number.
It is an amenable number.
110102322113 is a deficient number, since it is larger than the sum of its proper divisors (20067911167).
110102322113 is an equidigital number, since it uses as much as digits as its factorization.
110102322113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 542376007.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 110102322113 its reverse (311223201011), we get a palindrome (421325523124).
The spelling of 110102322113 in words is "one hundred ten billion, one hundred two million, three hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •