Base | Representation |
---|---|
bin | 110000001010010… |
… | …0100101110011001 |
3 | 11011121210121112121 |
4 | 1200110210232121 |
5 | 11302144143131 |
6 | 424204341241 |
7 | 55021552606 |
oct | 14024445631 |
9 | 4147717477 |
10 | 1616006041 |
11 | 75a214291 |
12 | 391244821 |
13 | 1c9a4b2c0 |
14 | 11489d6ad |
15 | 96d11911 |
hex | 60524b99 |
1616006041 has 8 divisors (see below), whose sum is σ = 1740662784. Its totient is φ = 1491399120.
The previous prime is 1616006027. The next prime is 1616006081. The reversal of 1616006041 is 1406006161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1616006041 is a prime.
It is a super-2 number, since 2×16160060412 = 5222951049096987362, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1616005997 and 1616006015.
It is not an unprimeable number, because it can be changed into a prime (1616006081) 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 in 7 ways as a sum of consecutive naturals, for example, 80850 + ... + 98836.
It is an arithmetic number, because the mean of its divisors is an integer number (217582848).
Almost surely, 21616006041 is an apocalyptic number.
It is an amenable number.
1616006041 is a deficient number, since it is larger than the sum of its proper divisors (124656743).
1616006041 is a wasteful number, since it uses less digits than its factorization.
1616006041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24911.
The product of its (nonzero) digits is 864, while the sum is 25.
The square root of 1616006041 is about 40199.5776221592. The cubic root of 1616006041 is about 1173.4943239537.
The spelling of 1616006041 in words is "one billion, six hundred sixteen million, six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •