Base | Representation |
---|---|
bin | 100111101100100… |
… | …1010100100110111 |
3 | 10102211101110100121 |
4 | 1033121022210313 |
5 | 10211442400413 |
6 | 340101152411 |
7 | 45002534062 |
oct | 11731124467 |
9 | 3384343317 |
10 | 1331996983 |
11 | 623972059 |
12 | 3120bb707 |
13 | 182c5bbc5 |
14 | c8c8d8d9 |
15 | 7be10b8d |
hex | 4f64a937 |
1331996983 has 2 divisors, whose sum is σ = 1331996984. Its totient is φ = 1331996982.
The previous prime is 1331996969. The next prime is 1331996987. The reversal of 1331996983 is 3896991331.
It is a strong prime.
It is an emirp because it is prime and its reverse (3896991331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1331996983 is a prime.
It is a super-2 number, since 2×13319969832 = 3548431925442204578, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1331996983.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1331996987) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665998491 + 665998492.
It is an arithmetic number, because the mean of its divisors is an integer number (665998492).
Almost surely, 21331996983 is an apocalyptic number.
1331996983 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331996983 is an equidigital number, since it uses as much as digits as its factorization.
1331996983 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 944784, while the sum is 52.
The square root of 1331996983 is about 36496.5338491205. The cubic root of 1331996983 is about 1100.2745824171.
The spelling of 1331996983 in words is "one billion, three hundred thirty-one million, nine hundred ninety-six thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •