Base | Representation |
---|---|
bin | 11001000010100110110110… |
… | …000101000101011100111111 |
3 | 112102221100120202002210120111 |
4 | 121002212312011011130333 |
5 | 103413333334133114403 |
6 | 1030121055545330451 |
7 | 32124436530606103 |
oct | 3102466605053477 |
9 | 472840522083514 |
10 | 110130311223103 |
11 | 321000036598a6 |
12 | 10427baa496a27 |
13 | 495b3227a3272 |
14 | 1d2a49a8a1903 |
15 | caeb1ea5056d |
hex | 6429b614573f |
110130311223103 has 32 divisors (see below), whose sum is σ = 126056389717440. Its totient is φ = 95560326512640.
The previous prime is 110130311223073. The next prime is 110130311223133. The reversal of 110130311223103 is 301322113031011.
It is an interprime number because it is at equal distance from previous prime (110130311223073) and next prime (110130311223133).
It is not a de Polignac number, because 110130311223103 - 217 = 110130311092031 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110130311223133) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5216226 + ... + 15731167.
It is an arithmetic number, because the mean of its divisors is an integer number (3939262178670).
Almost surely, 2110130311223103 is an apocalyptic number.
110130311223103 is a deficient number, since it is larger than the sum of its proper divisors (15926078494337).
110130311223103 is a wasteful number, since it uses less digits than its factorization.
110130311223103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20947867.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 110130311223103 its reverse (301322113031011), we get a palindrome (411452424254114).
The spelling of 110130311223103 in words is "one hundred ten trillion, one hundred thirty billion, three hundred eleven million, two hundred twenty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •