Base | Representation |
---|---|
bin | 1000101011111111… |
… | …11111110011100101 |
3 | 110001001021001201112 |
4 | 10111333333303211 |
5 | 34023000042003 |
6 | 2050451034405 |
7 | 223402620611 |
oct | 42577776345 |
9 | 13031231645 |
10 | 4664065253 |
11 | 1a8381a291 |
12 | aa1b9ba05 |
13 | 59438b733 |
14 | 323616341 |
15 | 1c46ea3d8 |
hex | 115fffce5 |
4664065253 has 2 divisors, whose sum is σ = 4664065254. Its totient is φ = 4664065252.
The previous prime is 4664065187. The next prime is 4664065267. The reversal of 4664065253 is 3525604664.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2624820289 + 2039244964 = 51233^2 + 45158^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4664065253 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4664065253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4664035253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2332032626 + 2332032627.
It is an arithmetic number, because the mean of its divisors is an integer number (2332032627).
Almost surely, 24664065253 is an apocalyptic number.
It is an amenable number.
4664065253 is a deficient number, since it is larger than the sum of its proper divisors (1).
4664065253 is an equidigital number, since it uses as much as digits as its factorization.
4664065253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 518400, while the sum is 41.
The square root of 4664065253 is about 68293.9620537570. The cubic root of 4664065253 is about 1670.7887381822.
The spelling of 4664065253 in words is "four billion, six hundred sixty-four million, sixty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •