Base | Representation |
---|---|
bin | 1111000110011010… |
… | …0110011000111001 |
3 | 101110111020110120102 |
4 | 3301212212120321 |
5 | 31300134142034 |
6 | 1510115005145 |
7 | 202306365446 |
oct | 36146463071 |
9 | 11414213512 |
10 | 4053427769 |
11 | 17a0066306 |
12 | 9515997b5 |
13 | 4c7a0a091 |
14 | 2a64a09cd |
15 | 18acca97e |
hex | f19a6639 |
4053427769 has 2 divisors, whose sum is σ = 4053427770. Its totient is φ = 4053427768.
The previous prime is 4053427753. The next prime is 4053427771. The reversal of 4053427769 is 9677243504.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3892137769 + 161290000 = 62387^2 + 12700^2 .
It is a cyclic number.
It is not a de Polignac number, because 4053427769 - 24 = 4053427753 is a prime.
It is a super-2 number, since 2×40534277692 = 32860553357000634722, which contains 22 as substring.
Together with 4053427771, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (4053427709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2026713884 + 2026713885.
It is an arithmetic number, because the mean of its divisors is an integer number (2026713885).
Almost surely, 24053427769 is an apocalyptic number.
It is an amenable number.
4053427769 is a deficient number, since it is larger than the sum of its proper divisors (1).
4053427769 is an equidigital number, since it uses as much as digits as its factorization.
4053427769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1270080, while the sum is 47.
The square root of 4053427769 is about 63666.5357075442. The cubic root of 4053427769 is about 1594.4374242610.
The spelling of 4053427769 in words is "four billion, fifty-three million, four hundred twenty-seven thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •