Base | Representation |
---|---|
bin | 11110000100111001… |
… | …00001110001000011 |
3 | 1112200022201201112211 |
4 | 33002130201301003 |
5 | 231032133111011 |
6 | 11230133402551 |
7 | 1111066411414 |
oct | 170234416103 |
9 | 45608651484 |
10 | 16147160131 |
11 | 6936718443 |
12 | 3167799457 |
13 | 16a43cc62b |
14 | ad271b80b |
15 | 6478b3b21 |
hex | 3c2721c43 |
16147160131 has 2 divisors, whose sum is σ = 16147160132. Its totient is φ = 16147160130.
The previous prime is 16147160083. The next prime is 16147160219. The reversal of 16147160131 is 13106174161.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 16147160131 - 29 = 16147159619 is a prime.
It is a super-2 number, since 2×161471601312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16147160093 and 16147160102.
It is not a weakly prime, because it can be changed into another prime (16147160231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8073580065 + 8073580066.
It is an arithmetic number, because the mean of its divisors is an integer number (8073580066).
Almost surely, 216147160131 is an apocalyptic number.
16147160131 is a deficient number, since it is larger than the sum of its proper divisors (1).
16147160131 is an equidigital number, since it uses as much as digits as its factorization.
16147160131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 31.
The spelling of 16147160131 in words is "sixteen billion, one hundred forty-seven million, one hundred sixty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •