Base | Representation |
---|---|
bin | 101010110110… |
… | …001100011101 |
3 | 210010122110002 |
4 | 222312030131 |
5 | 10333411104 |
6 | 1040424045 |
7 | 164320304 |
oct | 52661435 |
9 | 23118402 |
10 | 11232029 |
11 | 6381876 |
12 | 3918025 |
13 | 2433593 |
14 | 16c543b |
15 | ebd01e |
hex | ab631d |
11232029 has 2 divisors, whose sum is σ = 11232030. Its totient is φ = 11232028.
The previous prime is 11232017. The next prime is 11232031. The reversal of 11232029 is 92023211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8584900 + 2647129 = 2930^2 + 1627^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11232029 is a prime.
Together with 11232031, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11232029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11232049) 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 as a sum of consecutive naturals, namely, 5616014 + 5616015.
It is an arithmetic number, because the mean of its divisors is an integer number (5616015).
Almost surely, 211232029 is an apocalyptic number.
It is an amenable number.
11232029 is a deficient number, since it is larger than the sum of its proper divisors (1).
11232029 is an equidigital number, since it uses as much as digits as its factorization.
11232029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 11232029 is about 3351.4219370291. The cubic root of 11232029 is about 223.9508621489.
It can be divided in two parts, 1123202 and 9, that added together give a palindrome (1123211).
The spelling of 11232029 in words is "eleven million, two hundred thirty-two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •