Base | Representation |
---|---|
bin | 100001000101010… |
… | …1010010100000101 |
3 | 2212100211110120222 |
4 | 1002022222110011 |
5 | 4233140403023 |
6 | 302053034125 |
7 | 36336421643 |
oct | 10212522405 |
9 | 2770743528 |
10 | 1110091013 |
11 | 51a687899 |
12 | 26b925945 |
13 | 148ca4ab5 |
14 | a7608193 |
15 | 676cacc8 |
hex | 422aa505 |
1110091013 has 2 divisors, whose sum is σ = 1110091014. Its totient is φ = 1110091012.
The previous prime is 1110091009. The next prime is 1110091027. The reversal of 1110091013 is 3101900111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 569156449 + 540934564 = 23857^2 + 23258^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110091013 - 22 = 1110091009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1110090982 and 1110091000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110091033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555045506 + 555045507.
It is an arithmetic number, because the mean of its divisors is an integer number (555045507).
Almost surely, 21110091013 is an apocalyptic number.
It is an amenable number.
1110091013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110091013 is an equidigital number, since it uses as much as digits as its factorization.
1110091013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 17.
The square root of 1110091013 is about 33318.0283480280. The cubic root of 1110091013 is about 1035.4271033992.
Adding to 1110091013 its reverse (3101900111), we get a palindrome (4211991124).
The spelling of 1110091013 in words is "one billion, one hundred ten million, ninety-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •