Base | Representation |
---|---|
bin | 10000001001111101000… |
… | …100111111001111111101 |
3 | 10221010121202012120110211 |
4 | 100021331010333033331 |
5 | 121142142201201023 |
6 | 2210004023232421 |
7 | 143131535325025 |
oct | 20117504771775 |
9 | 3833552176424 |
10 | 1110200022013 |
11 | 398918a73555 |
12 | 15b1b78a8711 |
13 | 808cb059a64 |
14 | 3ba3c016a85 |
15 | 1dd2b1bea0d |
hex | 1027d13f3fd |
1110200022013 has 2 divisors, whose sum is σ = 1110200022014. Its totient is φ = 1110200022012.
The previous prime is 1110200022011. The next prime is 1110200022121. The reversal of 1110200022013 is 3102200020111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 702508832964 + 407691189049 = 838158^2 + 638507^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110200022013 - 21 = 1110200022011 is a prime.
Together with 1110200022011, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1110200021984 and 1110200022002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110200022011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555100011006 + 555100011007.
It is an arithmetic number, because the mean of its divisors is an integer number (555100011007).
Almost surely, 21110200022013 is an apocalyptic number.
It is an amenable number.
1110200022013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110200022013 is an equidigital number, since it uses as much as digits as its factorization.
1110200022013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1110200022013 its reverse (3102200020111), we get a palindrome (4212400042124).
The spelling of 1110200022013 in words is "one trillion, one hundred ten billion, two hundred million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •