Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …110110101111101010101 |
3 | 10220011120122010201221221 |
4 | 100000203232311331111 |
5 | 121011011421004343 |
6 | 2201214543010341 |
7 | 142323531101221 |
oct | 20004356657525 |
9 | 3804518121857 |
10 | 1100111109973 |
11 | 394611050617 |
12 | 159260b999b1 |
13 | 7c980b0b915 |
14 | 3b36214b781 |
15 | 1d93a5ec5ed |
hex | 10023bb5f55 |
1100111109973 has 2 divisors, whose sum is σ = 1100111109974. Its totient is φ = 1100111109972.
The previous prime is 1100111109917. The next prime is 1100111110051. The reversal of 1100111109973 is 3799011110011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1090756738449 + 9354371524 = 1044393^2 + 96718^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100111109973 is a prime.
It is a super-2 number, since 2×11001111099732 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100111109473) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550055554986 + 550055554987.
It is an arithmetic number, because the mean of its divisors is an integer number (550055554987).
Almost surely, 21100111109973 is an apocalyptic number.
It is an amenable number.
1100111109973 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100111109973 is an equidigital number, since it uses as much as digits as its factorization.
1100111109973 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1701, while the sum is 34.
Adding to 1100111109973 its reverse (3799011110011), we get a palindrome (4899122219984).
The spelling of 1100111109973 in words is "one trillion, one hundred billion, one hundred eleven million, one hundred nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •