Base | Representation |
---|---|
bin | 110011010010001000… |
… | …0101001101101110001 |
3 | 101112021011001012221001 |
4 | 1212210100221231301 |
5 | 3301021240322433 |
6 | 122332032202001 |
7 | 10646060435152 |
oct | 1464420515561 |
9 | 345234035831 |
10 | 110130010993 |
11 | 4278457a312 |
12 | 19416399301 |
13 | a50141a6a2 |
14 | 548a587929 |
15 | 2ce872957d |
hex | 19a4429b71 |
110130010993 has 2 divisors, whose sum is σ = 110130010994. Its totient is φ = 110130010992.
The previous prime is 110130010927. The next prime is 110130011039. The reversal of 110130010993 is 399010031011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79675223824 + 30454787169 = 282268^2 + 174513^2 .
It is a cyclic number.
It is not a de Polignac number, because 110130010993 - 233 = 101540076401 is a prime.
It is not a weakly prime, because it can be changed into another prime (110130014993) 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, 55065005496 + 55065005497.
It is an arithmetic number, because the mean of its divisors is an integer number (55065005497).
Almost surely, 2110130010993 is an apocalyptic number.
It is an amenable number.
110130010993 is a deficient number, since it is larger than the sum of its proper divisors (1).
110130010993 is an equidigital number, since it uses as much as digits as its factorization.
110130010993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 28.
The spelling of 110130010993 in words is "one hundred ten billion, one hundred thirty million, ten thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •