Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0110100000101010111 |
3 | 101112012202122012001012 |
4 | 1212203010310011113 |
5 | 3301001143134034 |
6 | 122330042122435 |
7 | 10645426444454 |
oct | 1464304640527 |
9 | 345182565035 |
10 | 110110130519 |
11 | 42774330874 |
12 | 1940b7b041b |
13 | a4ca2797ac |
14 | 5487a9082b |
15 | 2ce6aedcce |
hex | 19a3134157 |
110110130519 has 2 divisors, whose sum is σ = 110110130520. Its totient is φ = 110110130518.
The previous prime is 110110130503. The next prime is 110110130531. The reversal of 110110130519 is 915031011011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110110130519 - 24 = 110110130503 is a prime.
It is a super-2 number, since 2×1101101305192 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110110130494 and 110110130503.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110110133519) 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 as a sum of consecutive naturals, namely, 55055065259 + 55055065260.
It is an arithmetic number, because the mean of its divisors is an integer number (55055065260).
Almost surely, 2110110130519 is an apocalyptic number.
110110130519 is a deficient number, since it is larger than the sum of its proper divisors (1).
110110130519 is an equidigital number, since it uses as much as digits as its factorization.
110110130519 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135, while the sum is 23.
The spelling of 110110130519 in words is "one hundred ten billion, one hundred ten million, one hundred thirty thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •