Base | Representation |
---|---|
bin | 10000000000101001000… |
… | …110111011110010001001 |
3 | 10220011210220212110000101 |
4 | 100000221012323302021 |
5 | 121011203013430434 |
6 | 2201231524205401 |
7 | 142326004563106 |
oct | 20005106736211 |
9 | 3804726773011 |
10 | 1100201311369 |
11 | 394657a5a226 |
12 | 159287239861 |
13 | 7c996701424 |
14 | 3b37010baad |
15 | 1d9434b8b14 |
hex | 100291bbc89 |
1100201311369 has 2 divisors, whose sum is σ = 1100201311370. Its totient is φ = 1100201311368.
The previous prime is 1100201311367. The next prime is 1100201311487. The reversal of 1100201311369 is 9631131020011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 620384646025 + 479816665344 = 787645^2 + 692688^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100201311369 - 21 = 1100201311367 is a prime.
It is a super-2 number, since 2×11002013113692 (a number of 25 digits) contains 22 as substring.
Together with 1100201311367, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1100201311361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550100655684 + 550100655685.
It is an arithmetic number, because the mean of its divisors is an integer number (550100655685).
Almost surely, 21100201311369 is an apocalyptic number.
It is an amenable number.
1100201311369 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100201311369 is an equidigital number, since it uses as much as digits as its factorization.
1100201311369 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 28.
The spelling of 1100201311369 in words is "one trillion, one hundred billion, two hundred one million, three hundred eleven thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •