Base | Representation |
---|---|
bin | 1000101100000111… |
… | …01100000101010001 |
3 | 110001010002020021112 |
4 | 10112003230011101 |
5 | 34023222024131 |
6 | 2050523503105 |
7 | 223414061264 |
oct | 42603540521 |
9 | 13033066245 |
10 | 4665033041 |
11 | 1a84320409 |
12 | aa2387a95 |
13 | 59463a0a6 |
14 | 3237c8cdb |
15 | 1c483c02b |
hex | 1160ec151 |
4665033041 has 2 divisors, whose sum is σ = 4665033042. Its totient is φ = 4665033040.
The previous prime is 4665033031. The next prime is 4665033073. The reversal of 4665033041 is 1403305664.
It is an a-pointer prime, because the next prime (4665033073) can be obtained adding 4665033041 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4597382416 + 67650625 = 67804^2 + 8225^2 .
It is a cyclic number.
It is not a de Polignac number, because 4665033041 - 222 = 4660838737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4665032989 and 4665033007.
It is not a weakly prime, because it can be changed into another prime (4665033031) 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 as a sum of consecutive naturals, namely, 2332516520 + 2332516521.
It is an arithmetic number, because the mean of its divisors is an integer number (2332516521).
Almost surely, 24665033041 is an apocalyptic number.
It is an amenable number.
4665033041 is a deficient number, since it is larger than the sum of its proper divisors (1).
4665033041 is an equidigital number, since it uses as much as digits as its factorization.
4665033041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 32.
The square root of 4665033041 is about 68301.0471442422. The cubic root of 4665033041 is about 1670.9042924163.
The spelling of 4665033041 in words is "four billion, six hundred sixty-five million, thirty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •