Base | Representation |
---|---|
bin | 111011000100010… |
… | …000100001101011 |
3 | 2120001200121001002 |
4 | 323010100201223 |
5 | 4012142101021 |
6 | 242155545215 |
7 | 33362060141 |
oct | 7304204153 |
9 | 2501617032 |
10 | 990972011 |
11 | 469417a37 |
12 | 237a5b20b |
13 | 12a3c8b93 |
14 | 9587b591 |
15 | 5beeb50b |
hex | 3b11086b |
990972011 has 2 divisors, whose sum is σ = 990972012. Its totient is φ = 990972010.
The previous prime is 990971981. The next prime is 990972049. The reversal of 990972011 is 110279099.
It is an a-pointer prime, because the next prime (990972049) can be obtained adding 990972011 to its sum of digits (38).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 990972011 - 214 = 990955627 is a prime.
It is a super-4 number, since 4×9909720114 (a number of 37 digits) contains 4444 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (990972811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 495486005 + 495486006.
It is an arithmetic number, because the mean of its divisors is an integer number (495486006).
Almost surely, 2990972011 is an apocalyptic number.
990972011 is a deficient number, since it is larger than the sum of its proper divisors (1).
990972011 is an equidigital number, since it uses as much as digits as its factorization.
990972011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10206, while the sum is 38.
The square root of 990972011 is about 31479.7079243121. The cubic root of 990972011 is about 996.9815685720.
The spelling of 990972011 in words is "nine hundred ninety million, nine hundred seventy-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •