Base | Representation |
---|---|
bin | 1000101110110011… |
… | …11101101011010001 |
3 | 110002200122021012202 |
4 | 10113121331223101 |
5 | 34100014240424 |
6 | 2053052332545 |
7 | 224110235405 |
oct | 42731755321 |
9 | 13080567182 |
10 | 4687649489 |
11 | 1a96068496 |
12 | aa9a74155 |
13 | 5992283c3 |
14 | 3267d5105 |
15 | 1c68082ae |
hex | 11767dad1 |
4687649489 has 2 divisors, whose sum is σ = 4687649490. Its totient is φ = 4687649488.
The previous prime is 4687649459. The next prime is 4687649503. The reversal of 4687649489 is 9849467864.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4072609489 + 615040000 = 63817^2 + 24800^2 .
It is a cyclic number.
It is not a de Polignac number, because 4687649489 - 224 = 4670872273 is a prime.
It is a super-2 number, since 2×46876494892 = 43948115463443922242, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4687649459) 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, 2343824744 + 2343824745.
It is an arithmetic number, because the mean of its divisors is an integer number (2343824745).
Almost surely, 24687649489 is an apocalyptic number.
It is an amenable number.
4687649489 is a deficient number, since it is larger than the sum of its proper divisors (1).
4687649489 is an equidigital number, since it uses as much as digits as its factorization.
4687649489 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 83607552, while the sum is 65.
The square root of 4687649489 is about 68466.4113927406. The cubic root of 4687649489 is about 1673.6001657474.
The spelling of 4687649489 in words is "four billion, six hundred eighty-seven million, six hundred forty-nine thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •