Base | Representation |
---|---|
bin | 11101000111100000001… |
… | …000110001111110111111 |
3 | 21002021201120100101120221 |
4 | 131013200020301332333 |
5 | 230240341032102121 |
6 | 4131113211522211 |
7 | 264363444666265 |
oct | 35074010617677 |
9 | 7067646311527 |
10 | 2000920190911 |
11 | 701649313944 |
12 | 283960159367 |
13 | 1168bc0aa035 |
14 | 6cbb8b84435 |
15 | 370adb96b41 |
hex | 1d1e0231fbf |
2000920190911 has 2 divisors, whose sum is σ = 2000920190912. Its totient is φ = 2000920190910.
The previous prime is 2000920190891. The next prime is 2000920190921. The reversal of 2000920190911 is 1190910290002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2000920190911 - 213 = 2000920182719 is a prime.
It is a super-2 number, since 2×20009201909112 (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 (2000920190921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000460095455 + 1000460095456.
It is an arithmetic number, because the mean of its divisors is an integer number (1000460095456).
Almost surely, 22000920190911 is an apocalyptic number.
2000920190911 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000920190911 is an equidigital number, since it uses as much as digits as its factorization.
2000920190911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 34.
The spelling of 2000920190911 in words is "two trillion, nine hundred twenty million, one hundred ninety thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •