Base | Representation |
---|---|
bin | 101011110000… |
… | …000101001011 |
3 | 210120200200122 |
4 | 223300011023 |
5 | 10414003011 |
6 | 1045453455 |
7 | 166325462 |
oct | 53600513 |
9 | 23520618 |
10 | 11469131 |
11 | 6523a23 |
12 | 3a1128b |
13 | 24b748b |
14 | 17479d9 |
15 | 10183db |
hex | af014b |
11469131 has 2 divisors, whose sum is σ = 11469132. Its totient is φ = 11469130.
The previous prime is 11469109. The next prime is 11469137. The reversal of 11469131 is 13196411.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11469131 is a prime.
It is a super-2 number, since 2×114691312 = 263081931790322, which contains 22 as substring.
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 11469131.
It is not a weakly prime, because it can be changed into another prime (11469137) 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 as a sum of consecutive naturals, namely, 5734565 + 5734566.
It is an arithmetic number, because the mean of its divisors is an integer number (5734566).
Almost surely, 211469131 is an apocalyptic number.
11469131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11469131 is an equidigital number, since it uses as much as digits as its factorization.
11469131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 648, while the sum is 26.
The square root of 11469131 is about 3386.6105474353. The cubic root of 11469131 is about 225.5157289140.
The spelling of 11469131 in words is "eleven million, four hundred sixty-nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •