Base | Representation |
---|---|
bin | 11110101111101110… |
… | …00000100011110101 |
3 | 1120121100202012022001 |
4 | 33113313000203311 |
5 | 232301121023131 |
6 | 11325525535301 |
7 | 1123021166536 |
oct | 172767004365 |
9 | 46540665261 |
10 | 16506423541 |
11 | 700049a353 |
12 | 3247b74531 |
13 | 173097a02a |
14 | b2831a68d |
15 | 6691cc261 |
hex | 3d7dc08f5 |
16506423541 has 2 divisors, whose sum is σ = 16506423542. Its totient is φ = 16506423540.
The previous prime is 16506423539. The next prime is 16506423589. The reversal of 16506423541 is 14532460561.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9740703025 + 6765720516 = 98695^2 + 82254^2 .
It is an emirp because it is prime and its reverse (14532460561) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16506423541 - 21 = 16506423539 is a prime.
It is a super-2 number, since 2×165064235412 (a number of 21 digits) contains 22 as substring.
Together with 16506423539, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 16506423541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16506423511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8253211770 + 8253211771.
It is an arithmetic number, because the mean of its divisors is an integer number (8253211771).
Almost surely, 216506423541 is an apocalyptic number.
It is an amenable number.
16506423541 is a deficient number, since it is larger than the sum of its proper divisors (1).
16506423541 is an equidigital number, since it uses as much as digits as its factorization.
16506423541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 86400, while the sum is 37.
The spelling of 16506423541 in words is "sixteen billion, five hundred six million, four hundred twenty-three thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •