Base | Representation |
---|---|
bin | 101011101110… |
… | …001001101111 |
3 | 210120021212001 |
4 | 223232021233 |
5 | 10413224411 |
6 | 1045353131 |
7 | 166263445 |
oct | 53561157 |
9 | 23507761 |
10 | 11461231 |
11 | 6518aa1 |
12 | 3a087a7 |
13 | 24b39c2 |
14 | 1744b95 |
15 | 1015dc1 |
hex | aee26f |
11461231 has 8 divisors (see below), whose sum is σ = 11821040. Its totient is φ = 11104128.
The previous prime is 11461223. The next prime is 11461243. The reversal of 11461231 is 13216411.
11461231 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11461231 - 23 = 11461223 is a prime.
It is a super-2 number, since 2×114612312 = 262719632070722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11461199 and 11461208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11461031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10855 + ... + 11863.
It is an arithmetic number, because the mean of its divisors is an integer number (1477630).
Almost surely, 211461231 is an apocalyptic number.
11461231 is a deficient number, since it is larger than the sum of its proper divisors (359809).
11461231 is a wasteful number, since it uses less digits than its factorization.
11461231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1353.
The product of its digits is 144, while the sum is 19.
The square root of 11461231 is about 3385.4439886077. The cubic root of 11461231 is about 225.4639381995.
Adding to 11461231 its reverse (13216411), we get a palindrome (24677642).
The spelling of 11461231 in words is "eleven million, four hundred sixty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •