Base | Representation |
---|---|
bin | 10000000001100100100… |
… | …100110101000000000001 |
3 | 10220021101110012110112022 |
4 | 100001210210311000001 |
5 | 121020223421104044 |
6 | 2201514524211225 |
7 | 142362511043003 |
oct | 20014444650001 |
9 | 3807343173468 |
10 | 1101199003649 |
11 | 39501a1471a8 |
12 | 159505399b15 |
13 | 7cac53110a4 |
14 | 3b426818373 |
15 | 1d9a0d913ee |
hex | 10064935001 |
1101199003649 has 2 divisors, whose sum is σ = 1101199003650. Its totient is φ = 1101199003648.
The previous prime is 1101199003601. The next prime is 1101199003651. The reversal of 1101199003649 is 9463009911011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1006370112400 + 94828891249 = 1003180^2 + 307943^2 .
It is an emirp because it is prime and its reverse (9463009911011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1101199003649 - 240 = 1687375873 is a prime.
Together with 1101199003651, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1101199003049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550599501824 + 550599501825.
It is an arithmetic number, because the mean of its divisors is an integer number (550599501825).
Almost surely, 21101199003649 is an apocalyptic number.
It is an amenable number.
1101199003649 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101199003649 is an equidigital number, since it uses as much as digits as its factorization.
1101199003649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52488, while the sum is 44.
The spelling of 1101199003649 in words is "one trillion, one hundred one billion, one hundred ninety-nine million, three thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •