Base | Representation |
---|---|
bin | 1000101010011001… |
… | …01001100111110001 |
3 | 110000002221012210011 |
4 | 10111030221213301 |
5 | 34011023330131 |
6 | 2045250334521 |
7 | 223150330165 |
oct | 42514514761 |
9 | 13002835704 |
10 | 4650605041 |
11 | 1a77166445 |
12 | a9958a441 |
13 | 591657c04 |
14 | 321910ca5 |
15 | 1c343c0b1 |
hex | 1153299f1 |
4650605041 has 2 divisors, whose sum is σ = 4650605042. Its totient is φ = 4650605040.
The previous prime is 4650604993. The next prime is 4650605081. The reversal of 4650605041 is 1405060564.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4624544016 + 26061025 = 68004^2 + 5105^2 .
It is a cyclic number.
It is not a de Polignac number, because 4650605041 - 29 = 4650604529 is a prime.
It is a super-2 number, since 2×46506050412 = 43256254494749223362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4650604994 and 4650605012.
It is not a weakly prime, because it can be changed into another prime (4650605081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2325302520 + 2325302521.
It is an arithmetic number, because the mean of its divisors is an integer number (2325302521).
Almost surely, 24650605041 is an apocalyptic number.
It is an amenable number.
4650605041 is a deficient number, since it is larger than the sum of its proper divisors (1).
4650605041 is an equidigital number, since it uses as much as digits as its factorization.
4650605041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 4650605041 is about 68195.3447164834. The cubic root of 4650605041 is about 1669.1799242479.
The spelling of 4650605041 in words is "four billion, six hundred fifty million, six hundred five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •