Base | Representation |
---|---|
bin | 101000000100… |
… | …110011101101 |
3 | 201202201202212 |
4 | 220010303231 |
5 | 10142133303 |
6 | 1013100205 |
7 | 155203100 |
oct | 50046355 |
9 | 21681685 |
10 | 10505453 |
11 | 5a259a2 |
12 | 3627665 |
13 | 223a95a |
14 | 1576737 |
15 | dc7ad8 |
hex | a04ced |
10505453 has 12 divisors (see below), whose sum is σ = 12643740. Its totient is φ = 8692992.
The previous prime is 10505449. The next prime is 10505477. The reversal of 10505453 is 35450501.
It can be written as a sum of positive squares in 2 ways, for example, as 3467044 + 7038409 = 1862^2 + 2653^2 .
It is not a de Polignac number, because 10505453 - 22 = 10505449 is a prime.
It is a super-2 number, since 2×105054532 = 220729085470418, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10505413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2276 + ... + 5117.
It is an arithmetic number, because the mean of its divisors is an integer number (1053645).
Almost surely, 210505453 is an apocalyptic number.
It is an amenable number.
10505453 is a deficient number, since it is larger than the sum of its proper divisors (2138287).
10505453 is an equidigital number, since it uses as much as digits as its factorization.
10505453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7436 (or 7429 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 23.
The square root of 10505453 is about 3241.2116561558. The cubic root of 10505453 is about 219.0138576054.
Adding to 10505453 its reverse (35450501), we get a palindrome (45955954).
The spelling of 10505453 in words is "ten million, five hundred five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •