Base | Representation |
---|---|
bin | 11110011010000101… |
… | …11111101001000011 |
3 | 1120010201101202010002 |
4 | 33031002333221003 |
5 | 231413201004011 |
6 | 11255525430215 |
7 | 1115356230134 |
oct | 171502775103 |
9 | 46121352102 |
10 | 16325016131 |
11 | 6a18056276 |
12 | 31b726b36b |
13 | 1702202678 |
14 | b0c1b7c8b |
15 | 6582e6c3b |
hex | 3cd0bfa43 |
16325016131 has 2 divisors, whose sum is σ = 16325016132. Its totient is φ = 16325016130.
The previous prime is 16325016077. The next prime is 16325016133. The reversal of 16325016131 is 13161052361.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 16325016131 - 218 = 16324753987 is a prime.
It is a super-3 number, since 3×163250161313 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 16325016133, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 16325016094 and 16325016103.
It is not a weakly prime, because it can be changed into another prime (16325016133) 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, 8162508065 + 8162508066.
It is an arithmetic number, because the mean of its divisors is an integer number (8162508066).
Almost surely, 216325016131 is an apocalyptic number.
16325016131 is a deficient number, since it is larger than the sum of its proper divisors (1).
16325016131 is an equidigital number, since it uses as much as digits as its factorization.
16325016131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 29.
Adding to 16325016131 its reverse (13161052361), we get a palindrome (29486068492).
The spelling of 16325016131 in words is "sixteen billion, three hundred twenty-five million, sixteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •