Base | Representation |
---|---|
bin | 111110110100010… |
… | …010100001110001 |
3 | 2201110002101211121 |
4 | 332310102201301 |
5 | 4124244113034 |
6 | 252324342241 |
7 | 35054646334 |
oct | 7664224161 |
9 | 2643071747 |
10 | 1053894769 |
11 | 4a0994814 |
12 | 254b44981 |
13 | 13a45a295 |
14 | 9dd7a61b |
15 | 627ca1b4 |
hex | 3ed12871 |
1053894769 has 2 divisors, whose sum is σ = 1053894770. Its totient is φ = 1053894768.
The previous prime is 1053894767. The next prime is 1053894781. The reversal of 1053894769 is 9674983501.
It is a happy number.
1053894769 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1053846369 + 48400 = 32463^2 + 220^2 .
It is a cyclic number.
It is not a de Polignac number, because 1053894769 - 21 = 1053894767 is a prime.
It is a super-2 number, since 2×10538947692 = 2221388368251126722, which contains 22 as substring.
Together with 1053894767, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1053894767) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526947384 + 526947385.
It is an arithmetic number, because the mean of its divisors is an integer number (526947385).
Almost surely, 21053894769 is an apocalyptic number.
It is an amenable number.
1053894769 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053894769 is an equidigital number, since it uses as much as digits as its factorization.
1053894769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 52.
The square root of 1053894769 is about 32463.7454555077. The cubic root of 1053894769 is about 1017.6515137983.
The spelling of 1053894769 in words is "one billion, fifty-three million, eight hundred ninety-four thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •