Base | Representation |
---|---|
bin | 101110101110… |
… | …110101010101 |
3 | 212001101110111 |
4 | 232232311111 |
5 | 11114003303 |
6 | 1114323021 |
7 | 206061415 |
oct | 56566525 |
9 | 25041414 |
10 | 12250453 |
11 | 6a07a46 |
12 | 4129471 |
13 | 26cbcb7 |
14 | 18ac645 |
15 | 111eb6d |
hex | baed55 |
12250453 has 4 divisors (see below), whose sum is σ = 12258028. Its totient is φ = 12242880.
The previous prime is 12250397. The next prime is 12250463. The reversal of 12250453 is 35405221.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 35405221 = 239 ⋅148139.
It can be written as a sum of positive squares in 2 ways, for example, as 10284849 + 1965604 = 3207^2 + 1402^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12250453 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12250463) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 276 + ... + 4957.
It is an arithmetic number, because the mean of its divisors is an integer number (3064507).
Almost surely, 212250453 is an apocalyptic number.
It is an amenable number.
12250453 is a deficient number, since it is larger than the sum of its proper divisors (7575).
12250453 is an equidigital number, since it uses as much as digits as its factorization.
12250453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7574.
The product of its (nonzero) digits is 1200, while the sum is 22.
The square root of 12250453 is about 3500.0647136874. The cubic root of 12250453 is about 230.5246561021.
Adding to 12250453 its reverse (35405221), we get a palindrome (47655674).
The spelling of 12250453 in words is "twelve million, two hundred fifty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •