Base | Representation |
---|---|
bin | 111011011111001… |
… | …0111100010001011 |
3 | 12011002221101200012 |
4 | 1312332113202023 |
5 | 13041442421221 |
6 | 530022302135 |
7 | 100315144163 |
oct | 16676274213 |
9 | 5132841605 |
10 | 1996060811 |
11 | 9347a7038 |
12 | 47858794b |
13 | 25a6c8394 |
14 | 14d1515a3 |
15 | ba38565b |
hex | 76f9788b |
1996060811 has 2 divisors, whose sum is σ = 1996060812. Its totient is φ = 1996060810.
The previous prime is 1996060771. The next prime is 1996060823. The reversal of 1996060811 is 1180606991.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (1180606991) is a distict prime. It is also a bemirp because it and its reverse can be mirrored producing other two distinct primes, 1180909661 and 1669090811.
It is a cyclic number.
It is not a de Polignac number, because 1996060811 - 210 = 1996059787 is a prime.
It is a super-2 number, since 2×19960608112 = 7968517522419955442, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1996069811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 998030405 + 998030406.
It is an arithmetic number, because the mean of its divisors is an integer number (998030406).
Almost surely, 21996060811 is an apocalyptic number.
1996060811 is a deficient number, since it is larger than the sum of its proper divisors (1).
1996060811 is an equidigital number, since it uses as much as digits as its factorization.
1996060811 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 41.
The square root of 1996060811 is about 44677.2963707519. The cubic root of 1996060811 is about 1259.0933283748.
The spelling of 1996060811 in words is "one billion, nine hundred ninety-six million, sixty thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •