Base | Representation |
---|---|
bin | 11101000110101111111… |
… | …110010100110100110101 |
3 | 21002012122020212100011022 |
4 | 131012233332110310311 |
5 | 230232212202044134 |
6 | 4130501104350525 |
7 | 264334433465363 |
oct | 35065776246465 |
9 | 7065566770138 |
10 | 2000112143669 |
11 | 701274187002 |
12 | 283775615445 |
13 | 1167c086a383 |
14 | 6cb3d722633 |
15 | 37062c8052e |
hex | 1d1aff94d35 |
2000112143669 has 2 divisors, whose sum is σ = 2000112143670. Its totient is φ = 2000112143668.
The previous prime is 2000112143647. The next prime is 2000112143707. The reversal of 2000112143669 is 9663412110002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1308536951569 + 691575192100 = 1143913^2 + 831610^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2000112143669 is a prime.
It is a super-2 number, since 2×20001121436692 (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 (2000112143609) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000056071834 + 1000056071835.
It is an arithmetic number, because the mean of its divisors is an integer number (1000056071835).
Almost surely, 22000112143669 is an apocalyptic number.
It is an amenable number.
2000112143669 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000112143669 is an equidigital number, since it uses as much as digits as its factorization.
2000112143669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 35.
The spelling of 2000112143669 in words is "two trillion, one hundred twelve million, one hundred forty-three thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •