Base | Representation |
---|---|
bin | 111110101110110… |
… | …010101000011001 |
3 | 2201100101011122121 |
4 | 332232302220121 |
5 | 4123412002101 |
6 | 252233421241 |
7 | 35036464156 |
oct | 7656625031 |
9 | 2640334577 |
10 | 1052453401 |
11 | 4a009a8aa |
12 | 25456a821 |
13 | 13a0741bc |
14 | 9dac322d |
15 | 625e30a1 |
hex | 3ebb2a19 |
1052453401 has 2 divisors, whose sum is σ = 1052453402. Its totient is φ = 1052453400.
The previous prime is 1052453351. The next prime is 1052453407. The reversal of 1052453401 is 1043542501.
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., 784280025 + 268173376 = 28005^2 + 16376^2 .
It is a cyclic number.
It is not a de Polignac number, because 1052453401 - 29 = 1052452889 is a prime.
It is a super-2 number, since 2×10524534012 = 2215316322552933602, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1052453407) 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, 526226700 + 526226701.
It is an arithmetic number, because the mean of its divisors is an integer number (526226701).
Almost surely, 21052453401 is an apocalyptic number.
It is an amenable number.
1052453401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1052453401 is an equidigital number, since it uses as much as digits as its factorization.
1052453401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 1052453401 is about 32441.5382033590. The cubic root of 1052453401 is about 1017.1873689338.
Adding to 1052453401 its reverse (1043542501), we get a palindrome (2095995902).
The spelling of 1052453401 in words is "one billion, fifty-two million, four hundred fifty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •