Base | Representation |
---|---|
bin | 11101110100001000… |
… | …00000100101110101 |
3 | 1112022112002012210011 |
4 | 32322010000211311 |
5 | 230240131440221 |
6 | 11204151100221 |
7 | 1104441063445 |
oct | 167204004565 |
9 | 45275065704 |
10 | 16006515061 |
11 | 6874295749 |
12 | 3128671671 |
13 | 16812277b4 |
14 | abbb8a125 |
15 | 63a3811e1 |
hex | 3ba100975 |
16006515061 has 4 divisors (see below), whose sum is σ = 16112518624. Its totient is φ = 15900511500.
The previous prime is 16006515013. The next prime is 16006515067. The reversal of 16006515061 is 16051560061.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 16051560061 = 51713 ⋅310397.
It is a cyclic number.
It is not a de Polignac number, because 16006515061 - 27 = 16006514933 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16006515067) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53001555 + ... + 53001856.
It is an arithmetic number, because the mean of its divisors is an integer number (4028129656).
Almost surely, 216006515061 is an apocalyptic number.
It is an amenable number.
16006515061 is a deficient number, since it is larger than the sum of its proper divisors (106003563).
16006515061 is a wasteful number, since it uses less digits than its factorization.
16006515061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106003562.
The product of its (nonzero) digits is 5400, while the sum is 31.
The spelling of 16006515061 in words is "sixteen billion, six million, five hundred fifteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •