Base | Representation |
---|---|
bin | 1001001111110100… |
… | …11001000010111111 |
3 | 110210222202002020002 |
4 | 10213322121002333 |
5 | 40131413220123 |
6 | 2140344144515 |
7 | 234012165452 |
oct | 44772310277 |
9 | 13728662202 |
10 | 4964585663 |
11 | 2118419764 |
12 | b6676813b |
13 | 61170c36b |
14 | 3514c3499 |
15 | 1e0cad528 |
hex | 127e990bf |
4964585663 has 2 divisors, whose sum is σ = 4964585664. Its totient is φ = 4964585662.
The previous prime is 4964585657. The next prime is 4964585669. The reversal of 4964585663 is 3665854694.
It is a balanced prime because it is at equal distance from previous prime (4964585657) and next prime (4964585669).
It is a cyclic number.
It is not a de Polignac number, because 4964585663 - 224 = 4947808447 is a prime.
It is a super-2 number, since 2×49645856632 = 49294221610530299138, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4964585599 and 4964585608.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4964585669) 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 as a sum of consecutive naturals, namely, 2482292831 + 2482292832.
It is an arithmetic number, because the mean of its divisors is an integer number (2482292832).
Almost surely, 24964585663 is an apocalyptic number.
4964585663 is a deficient number, since it is larger than the sum of its proper divisors (1).
4964585663 is an equidigital number, since it uses as much as digits as its factorization.
4964585663 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18662400, while the sum is 56.
The square root of 4964585663 is about 70459.8159449768. The cubic root of 4964585663 is about 1705.9291997654.
The spelling of 4964585663 in words is "four billion, nine hundred sixty-four million, five hundred eighty-five thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •