Base | Representation |
---|---|
bin | 101010000101… |
… | …001010101101 |
3 | 202202102222110 |
4 | 222011022231 |
5 | 10310444323 |
6 | 1032234233 |
7 | 162522654 |
oct | 52051255 |
9 | 22672873 |
10 | 11031213 |
11 | 6254a06 |
12 | 383b979 |
13 | 239305b |
14 | 167219b |
15 | e7d793 |
hex | a852ad |
11031213 has 4 divisors (see below), whose sum is σ = 14708288. Its totient is φ = 7354140.
The previous prime is 11031193. The next prime is 11031221. The reversal of 11031213 is 31213011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31213011 = 3 ⋅10404337.
It is not a de Polignac number, because 11031213 - 216 = 10965677 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11031253) 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 in 3 ways as a sum of consecutive naturals, for example, 1838533 + ... + 1838538.
It is an arithmetic number, because the mean of its divisors is an integer number (3677072).
Almost surely, 211031213 is an apocalyptic number.
It is an amenable number.
11031213 is a deficient number, since it is larger than the sum of its proper divisors (3677075).
11031213 is an equidigital number, since it uses as much as digits as its factorization.
11031213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3677074.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 11031213 is about 3321.3269938385. The cubic root of 11031213 is about 222.6081652261.
Adding to 11031213 its reverse (31213011), we get a palindrome (42244224).
The spelling of 11031213 in words is "eleven million, thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •