Base | Representation |
---|---|
bin | 101010000001… |
… | …000011111101 |
3 | 202201120220122 |
4 | 222001003331 |
5 | 10304430042 |
6 | 1032024325 |
7 | 162422642 |
oct | 52010375 |
9 | 22646818 |
10 | 11014397 |
11 | 6243309 |
12 | 38320a5 |
13 | 23884c4 |
14 | 1669dc9 |
15 | e787d2 |
hex | a810fd |
11014397 has 4 divisors (see below), whose sum is σ = 11072256. Its totient is φ = 10956540.
The previous prime is 11014379. The next prime is 11014429. The reversal of 11014397 is 79341011.
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: 79341011 = 8693 ⋅9127.
It is a cyclic number.
It is not a de Polignac number, because 11014397 - 28 = 11014141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11014337) 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, 28643 + ... + 29024.
It is an arithmetic number, because the mean of its divisors is an integer number (2768064).
Almost surely, 211014397 is an apocalyptic number.
It is an amenable number.
11014397 is a deficient number, since it is larger than the sum of its proper divisors (57859).
11014397 is an equidigital number, since it uses as much as digits as its factorization.
11014397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57858.
The product of its (nonzero) digits is 756, while the sum is 26.
The square root of 11014397 is about 3318.7945100593. The cubic root of 11014397 is about 222.4949929438.
It can be divided in two parts, 11014 and 397, that added together give a palindrome (11411).
The spelling of 11014397 in words is "eleven million, fourteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •