Base | Representation |
---|---|
bin | 111110101101011… |
… | …101011100000101 |
3 | 2201022201102222121 |
4 | 332231131130011 |
5 | 4123314320303 |
6 | 252222125541 |
7 | 35033511631 |
oct | 7655353405 |
9 | 2638642877 |
10 | 1052104453 |
11 | 49a981714 |
12 | 2544208b1 |
13 | 139c8141a |
14 | 9da31dc1 |
15 | 625749bd |
hex | 3eb5d705 |
1052104453 has 2 divisors, whose sum is σ = 1052104454. Its totient is φ = 1052104452.
The previous prime is 1052104441. The next prime is 1052104457. The reversal of 1052104453 is 3544012501.
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., 1015888129 + 36216324 = 31873^2 + 6018^2 .
It is an emirp because it is prime and its reverse (3544012501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1052104453 - 25 = 1052104421 is a prime.
It is a super-2 number, since 2×10521044532 = 2213847560044858418, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1052104457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526052226 + 526052227.
It is an arithmetic number, because the mean of its divisors is an integer number (526052227).
Almost surely, 21052104453 is an apocalyptic number.
It is an amenable number.
1052104453 is a deficient number, since it is larger than the sum of its proper divisors (1).
1052104453 is an equidigital number, since it uses as much as digits as its factorization.
1052104453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 1052104453 is about 32436.1596524619. The cubic root of 1052104453 is about 1017.0749380705.
Adding to 1052104453 its reverse (3544012501), we get a palindrome (4596116954).
The spelling of 1052104453 in words is "one billion, fifty-two million, one hundred four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •