Base | Representation |
---|---|
bin | 11110111100110011… |
… | …01100100101001001 |
3 | 1120220000021101220121 |
4 | 33132121230211021 |
5 | 233012220230131 |
6 | 11344450223241 |
7 | 1125523125406 |
oct | 173631544511 |
9 | 46800241817 |
10 | 16616180041 |
11 | 7057444aaa |
12 | 3278884b21 |
13 | 174a6285c6 |
14 | b38b2b2ad |
15 | 673b5c911 |
hex | 3de66c949 |
16616180041 has 4 divisors (see below), whose sum is σ = 16623000772. Its totient is φ = 16609359312.
The previous prime is 16616179999. The next prime is 16616180107. The reversal of 16616180041 is 14008161661.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14545566025 + 2070614016 = 120605^2 + 45504^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16616180041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16616179979 and 16616180006.
It is not an unprimeable number, because it can be changed into a prime (16616100041) 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 in 3 ways as a sum of consecutive naturals, for example, 3406710 + ... + 3411583.
It is an arithmetic number, because the mean of its divisors is an integer number (4155750193).
Almost surely, 216616180041 is an apocalyptic number.
It is an amenable number.
16616180041 is a deficient number, since it is larger than the sum of its proper divisors (6820731).
16616180041 is an equidigital number, since it uses as much as digits as its factorization.
16616180041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6820730.
The product of its (nonzero) digits is 6912, while the sum is 34.
The spelling of 16616180041 in words is "sixteen billion, six hundred sixteen million, one hundred eighty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •