Base | Representation |
---|---|
bin | 11110000011001001… |
… | …00100010100000101 |
3 | 1112122022010102121012 |
4 | 33001210210110011 |
5 | 231014404144001 |
6 | 11224451132005 |
7 | 1110530623001 |
oct | 170144442405 |
9 | 45568112535 |
10 | 16132490501 |
11 | 6929408986 |
12 | 31628a4005 |
13 | 16a136448a |
14 | ad07bd701 |
15 | 6464672bb |
hex | 3c1924505 |
16132490501 has 2 divisors, whose sum is σ = 16132490502. Its totient is φ = 16132490500.
The previous prime is 16132490497. The next prime is 16132490579. The reversal of 16132490501 is 10509423161.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11610062500 + 4522428001 = 107750^2 + 67249^2 .
It is a cyclic number.
It is not a de Polignac number, because 16132490501 - 22 = 16132490497 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16132490401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8066245250 + 8066245251.
It is an arithmetic number, because the mean of its divisors is an integer number (8066245251).
Almost surely, 216132490501 is an apocalyptic number.
It is an amenable number.
16132490501 is a deficient number, since it is larger than the sum of its proper divisors (1).
16132490501 is an equidigital number, since it uses as much as digits as its factorization.
16132490501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 32.
The spelling of 16132490501 in words is "sixteen billion, one hundred thirty-two million, four hundred ninety thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •