Base | Representation |
---|---|
bin | 1010000000111011100010… |
… | …1101000100011011001101 |
3 | 1102222122120111021012111111 |
4 | 2200032320231010123031 |
5 | 2420401213100030442 |
6 | 35230232435052021 |
7 | 2214345215510224 |
oct | 240167055043315 |
9 | 42878514235444 |
10 | 11011100001997 |
11 | 356586598a787 |
12 | 129a037141011 |
13 | 61b45ac93084 |
14 | 2a0d23837cbb |
15 | 141655dedb17 |
hex | a03b8b446cd |
11011100001997 has 2 divisors, whose sum is σ = 11011100001998. Its totient is φ = 11011100001996.
The previous prime is 11011100001989. The next prime is 11011100002031. The reversal of 11011100001997 is 79910000111011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10659532831236 + 351567170761 = 3264894^2 + 592931^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011100001997 - 23 = 11011100001989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011100001907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505550000998 + 5505550000999.
It is an arithmetic number, because the mean of its divisors is an integer number (5505550000999).
Almost surely, 211011100001997 is an apocalyptic number.
It is an amenable number.
11011100001997 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011100001997 is an equidigital number, since it uses as much as digits as its factorization.
11011100001997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 567, while the sum is 31.
The spelling of 11011100001997 in words is "eleven trillion, eleven billion, one hundred million, one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •