Base | Representation |
---|---|
bin | 11101110100110101… |
… | …00010100001101111 |
3 | 1112022221012021112012 |
4 | 32322122202201233 |
5 | 230243134434411 |
6 | 11204521431435 |
7 | 1104542222552 |
oct | 167232424157 |
9 | 45287167465 |
10 | 16012421231 |
11 | 687765a084 |
12 | 312a63b57b |
13 | 1682514b81 |
14 | abc886699 |
15 | 63ab4b18b |
hex | 3ba6a286f |
16012421231 has 2 divisors, whose sum is σ = 16012421232. Its totient is φ = 16012421230.
The previous prime is 16012421207. The next prime is 16012421233. The reversal of 16012421231 is 13212421061.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 16012421231 - 26 = 16012421167 is a prime.
It is a super-2 number, since 2×160124212312 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 16012421233, 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 = 16012421197 and 16012421206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16012421233) 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, 8006210615 + 8006210616.
It is an arithmetic number, because the mean of its divisors is an integer number (8006210616).
Almost surely, 216012421231 is an apocalyptic number.
16012421231 is a deficient number, since it is larger than the sum of its proper divisors (1).
16012421231 is an equidigital number, since it uses as much as digits as its factorization.
16012421231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 16012421231 its reverse (13212421061), we get a palindrome (29224842292).
The spelling of 16012421231 in words is "sixteen billion, twelve million, four hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •