Base | Representation |
---|---|
bin | 101010110101… |
… | …100100010101 |
3 | 210010111220222 |
4 | 222311210111 |
5 | 10333320321 |
6 | 1040404125 |
7 | 164306645 |
oct | 52654425 |
9 | 23114828 |
10 | 11229461 |
11 | 637a951 |
12 | 3916645 |
13 | 2432369 |
14 | 16c4525 |
15 | ebc3ab |
hex | ab5915 |
11229461 has 2 divisors, whose sum is σ = 11229462. Its totient is φ = 11229460.
The previous prime is 11229457. The next prime is 11229509. The reversal of 11229461 is 16492211.
11229461 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6345361 + 4884100 = 2519^2 + 2210^2 .
It is a cyclic number.
It is not a de Polignac number, because 11229461 - 22 = 11229457 is a prime.
It is a super-2 number, since 2×112294612 = 252201588701042, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11229461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11229761) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5614730 + 5614731.
It is an arithmetic number, because the mean of its divisors is an integer number (5614731).
Almost surely, 211229461 is an apocalyptic number.
It is an amenable number.
11229461 is a deficient number, since it is larger than the sum of its proper divisors (1).
11229461 is an equidigital number, since it uses as much as digits as its factorization.
11229461 is an evil number, because the sum of its binary digits is even.
The product of its digits is 864, while the sum is 26.
The square root of 11229461 is about 3351.0387941652. The cubic root of 11229461 is about 223.9337934119.
The spelling of 11229461 in words is "eleven million, two hundred twenty-nine thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •