Base | Representation |
---|---|
bin | 101011110101… |
… | …010010010101 |
3 | 210121202221100 |
4 | 223311102111 |
5 | 10420143303 |
6 | 1050140313 |
7 | 166444602 |
oct | 53652225 |
9 | 23552840 |
10 | 11490453 |
11 | 6538a47 |
12 | 3a21699 |
13 | 24c40b0 |
14 | 17516a9 |
15 | 101e8a3 |
hex | af5495 |
11490453 has 48 divisors (see below), whose sum is σ = 19459440. Its totient is φ = 6469632.
The previous prime is 11490449. The next prime is 11490463. The reversal of 11490453 is 35409411.
It can be written as a sum of positive squares in 8 ways, for example, as 321489 + 11168964 = 567^2 + 3342^2 .
It is not a de Polignac number, because 11490453 - 22 = 11490449 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11490463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 105363 + ... + 105471.
It is an arithmetic number, because the mean of its divisors is an integer number (405405).
Almost surely, 211490453 is an apocalyptic number.
11490453 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11490453 is a deficient number, since it is larger than the sum of its proper divisors (7968987).
11490453 is a wasteful number, since it uses less digits than its factorization.
11490453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198 (or 195 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 11490453 is about 3389.7570709418. The cubic root of 11490453 is about 225.6553927847.
Adding to 11490453 its reverse (35409411), we get a palindrome (46899864).
The spelling of 11490453 in words is "eleven million, four hundred ninety thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •