Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …111010111001001101101 |
3 | 21002101210120001211012121 |
4 | 131020213013113021231 |
5 | 230300310404014242 |
6 | 4131431311032541 |
7 | 264435114501346 |
oct | 35104707271155 |
9 | 7071716054177 |
10 | 2002111001197 |
11 | 7020aa51327a |
12 | 284032b0b751 |
13 | 116a4ba046c8 |
14 | 6cc8cda10cd |
15 | 3712d4b9667 |
hex | 1d2271d726d |
2002111001197 has 2 divisors, whose sum is σ = 2002111001198. Its totient is φ = 2002111001196.
The previous prime is 2002111001173. The next prime is 2002111001243. The reversal of 2002111001197 is 7911001112002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1936478197476 + 65632803721 = 1391574^2 + 256189^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002111001197 is a prime.
It is a super-3 number, since 3×20021110011973 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2002111001167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001055500598 + 1001055500599.
It is an arithmetic number, because the mean of its divisors is an integer number (1001055500599).
Almost surely, 22002111001197 is an apocalyptic number.
It is an amenable number.
2002111001197 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002111001197 is an equidigital number, since it uses as much as digits as its factorization.
2002111001197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 25.
Adding to 2002111001197 its reverse (7911001112002), we get a palindrome (9913112113199).
The spelling of 2002111001197 in words is "two trillion, two billion, one hundred eleven million, one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •