Base | Representation |
---|---|
bin | 1000101011100101… |
… | …10100011111100001 |
3 | 110000210202120102202 |
4 | 10111302310133201 |
5 | 34021104023131 |
6 | 2050245022545 |
7 | 223331353202 |
oct | 42562643741 |
9 | 13023676382 |
10 | 4660611041 |
11 | 1a81880069 |
12 | aa09b4a55 |
13 | 59374c418 |
14 | 322d975a9 |
15 | 1c4266bcb |
hex | 115cb47e1 |
4660611041 has 2 divisors, whose sum is σ = 4660611042. Its totient is φ = 4660611040.
The previous prime is 4660611037. The next prime is 4660611073. The reversal of 4660611041 is 1401160664.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4604301025 + 56310016 = 67855^2 + 7504^2 .
It is a cyclic number.
It is not a de Polignac number, because 4660611041 - 22 = 4660611037 is a prime.
It is a super-2 number, since 2×46606110412 = 43442590550982207362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4660610995 and 4660611013.
It is not a weakly prime, because it can be changed into another prime (4660611341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2330305520 + 2330305521.
It is an arithmetic number, because the mean of its divisors is an integer number (2330305521).
Almost surely, 24660611041 is an apocalyptic number.
It is an amenable number.
4660611041 is a deficient number, since it is larger than the sum of its proper divisors (1).
4660611041 is an equidigital number, since it uses as much as digits as its factorization.
4660611041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
The square root of 4660611041 is about 68268.6680769443. The cubic root of 4660611041 is about 1670.3761736406.
The spelling of 4660611041 in words is "four billion, six hundred sixty million, six hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •