Base | Representation |
---|---|
bin | 11111110011101100111… |
… | …01101111011011011001 |
3 | 10212110222201110212021202 |
4 | 33321312131233123121 |
5 | 120401234223413423 |
6 | 2154024153043545 |
7 | 141650210634332 |
oct | 17716635573331 |
9 | 3773881425252 |
10 | 1092909201113 |
11 | 39155582a924 |
12 | 1579910b65b5 |
13 | 7c0a3a308a2 |
14 | 3ac7b873289 |
15 | 1d6681ed728 |
hex | fe7676f6d9 |
1092909201113 has 2 divisors, whose sum is σ = 1092909201114. Its totient is φ = 1092909201112.
The previous prime is 1092909201077. The next prime is 1092909201121. The reversal of 1092909201113 is 3111029092901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1072657918864 + 20251282249 = 1035692^2 + 142307^2 .
It is an emirp because it is prime and its reverse (3111029092901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1092909201113 - 214 = 1092909184729 is a prime.
It is not a weakly prime, because it can be changed into another prime (1092909201413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 546454600556 + 546454600557.
It is an arithmetic number, because the mean of its divisors is an integer number (546454600557).
Almost surely, 21092909201113 is an apocalyptic number.
It is an amenable number.
1092909201113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1092909201113 is an equidigital number, since it uses as much as digits as its factorization.
1092909201113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 38.
The spelling of 1092909201113 in words is "one trillion, ninety-two billion, nine hundred nine million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •