Base | Representation |
---|---|
bin | 1001101111110001… |
… | …1100110101101001 |
3 | 20202100001120210111 |
4 | 2123330130311221 |
5 | 20324234041431 |
6 | 1111340414321 |
7 | 121556212141 |
oct | 23374346551 |
9 | 6670046714 |
10 | 2616315241 |
11 | 1122929401 |
12 | 6102473a1 |
13 | 329066137 |
14 | 1ab68b921 |
15 | 104a547b1 |
hex | 9bf1cd69 |
2616315241 has 8 divisors (see below), whose sum is σ = 2637375104. Its totient is φ = 2595304800.
The previous prime is 2616315223. The next prime is 2616315259. The reversal of 2616315241 is 1425136162.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2616315223) and next prime (2616315259).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2616315241 - 25 = 2616315209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2616315041) 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 7 ways as a sum of consecutive naturals, for example, 97861 + ... + 121693.
It is an arithmetic number, because the mean of its divisors is an integer number (329671888).
Almost surely, 22616315241 is an apocalyptic number.
It is an amenable number.
2616315241 is a deficient number, since it is larger than the sum of its proper divisors (21059863).
2616315241 is a wasteful number, since it uses less digits than its factorization.
2616315241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24711.
The product of its digits is 8640, while the sum is 31.
The square root of 2616315241 is about 51149.9290419840. The cubic root of 2616315241 is about 1377.9390999605.
The spelling of 2616315241 in words is "two billion, six hundred sixteen million, three hundred fifteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •