Base | Representation |
---|---|
bin | 10000000000100010100… |
… | …100111000011010010001 |
3 | 10220011112021122200210012 |
4 | 100000202210320122101 |
5 | 121010441440040421 |
6 | 2201213011244305 |
7 | 142323204226523 |
oct | 20004244703221 |
9 | 3804467580705 |
10 | 1100091721361 |
11 | 394601108676 |
12 | 1592565a9695 |
13 | 7c979ab0879 |
14 | 3b35d741a13 |
15 | 1d938a6c95b |
hex | 10022938691 |
1100091721361 has 2 divisors, whose sum is σ = 1100091721362. Its totient is φ = 1100091721360.
The previous prime is 1100091721357. The next prime is 1100091721403. The reversal of 1100091721361 is 1631271900011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1086483099025 + 13608622336 = 1042345^2 + 116656^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100091721361 - 22 = 1100091721357 is a prime.
It is not a weakly prime, because it can be changed into another prime (1100091781361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550045860680 + 550045860681.
It is an arithmetic number, because the mean of its divisors is an integer number (550045860681).
Almost surely, 21100091721361 is an apocalyptic number.
It is an amenable number.
1100091721361 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100091721361 is an equidigital number, since it uses as much as digits as its factorization.
1100091721361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 32.
The spelling of 1100091721361 in words is "one trillion, one hundred billion, ninety-one million, seven hundred twenty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •