Base | Representation |
---|---|
bin | 101011011100… |
… | …111011101111 |
3 | 210102201002220 |
4 | 223130323233 |
5 | 10404000303 |
6 | 1044050423 |
7 | 165551022 |
oct | 53347357 |
9 | 23381086 |
10 | 11390703 |
11 | 6480005 |
12 | 3993a13 |
13 | 248a87c |
14 | 17271b9 |
15 | 1000053 |
hex | adceef |
11390703 has 8 divisors (see below), whose sum is σ = 15234816. Its totient is φ = 7570200.
The previous prime is 11390699. The next prime is 11390719. The reversal of 11390703 is 30709311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11390703 - 22 = 11390699 is a prime.
It is a super-2 number, since 2×113907032 = 259496229668418, which contains 22 as substring.
It is a Smith number, since the sum of its digits (24) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11390723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4743 + ... + 6728.
It is an arithmetic number, because the mean of its divisors is an integer number (1904352).
Almost surely, 211390703 is an apocalyptic number.
11390703 is a deficient number, since it is larger than the sum of its proper divisors (3844113).
11390703 is a wasteful number, since it uses less digits than its factorization.
11390703 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11805.
The product of its (nonzero) digits is 567, while the sum is 24.
The square root of 11390703 is about 3375.0115555358. The cubic root of 11390703 is about 225.0005135791. Note that the first 3 decimals are identical.
The spelling of 11390703 in words is "eleven million, three hundred ninety thousand, seven hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •