Base | Representation |
---|---|
bin | 10000001001111101001… |
… | …100100100100100111001 |
3 | 10221010121212221120100202 |
4 | 100021331030210210321 |
5 | 121142143203304123 |
6 | 2210004134011545 |
7 | 143131561244453 |
oct | 20117514444471 |
9 | 3833555846322 |
10 | 1110202009913 |
11 | 39891a101047 |
12 | 15b1b84a6bb5 |
13 | 808cb5a4829 |
14 | 3ba3c3b32d3 |
15 | 1dd2b463a28 |
hex | 1027d324939 |
1110202009913 has 2 divisors, whose sum is σ = 1110202009914. Its totient is φ = 1110202009912.
The previous prime is 1110202009907. The next prime is 1110202010033. The reversal of 1110202009913 is 3199002020111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 832349678224 + 277852331689 = 912332^2 + 527117^2 .
It is an emirp because it is prime and its reverse (3199002020111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1110202009913 - 214 = 1110201993529 is a prime.
It is not a weakly prime, because it can be changed into another prime (1110202009313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555101004956 + 555101004957.
It is an arithmetic number, because the mean of its divisors is an integer number (555101004957).
Almost surely, 21110202009913 is an apocalyptic number.
It is an amenable number.
1110202009913 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110202009913 is an equidigital number, since it uses as much as digits as its factorization.
1110202009913 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 29.
The spelling of 1110202009913 in words is "one trillion, one hundred ten billion, two hundred two million, nine thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •