Base | Representation |
---|---|
bin | 101101110000… |
… | …010000010111 |
3 | 211120100212020 |
4 | 231300100113 |
5 | 11032303020 |
6 | 1105024223 |
7 | 203643216 |
oct | 55602027 |
9 | 24510766 |
10 | 11994135 |
11 | 685240a |
12 | 4025073 |
13 | 263c42a |
14 | 184307d |
15 | 10bdc40 |
hex | b70417 |
11994135 has 8 divisors (see below), whose sum is σ = 19190640. Its totient is φ = 6396864.
The previous prime is 11994133. The next prime is 11994161. The reversal of 11994135 is 53149911.
11994135 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 not a de Polignac number, because 11994135 - 21 = 11994133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11994096 and 11994105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11994131) 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 7 ways as a sum of consecutive naturals, for example, 399790 + ... + 399819.
It is an arithmetic number, because the mean of its divisors is an integer number (2398830).
Almost surely, 211994135 is an apocalyptic number.
11994135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11994135 is a deficient number, since it is larger than the sum of its proper divisors (7196505).
11994135 is an equidigital number, since it uses as much as digits as its factorization.
11994135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 799617.
The product of its digits is 4860, while the sum is 33.
The square root of 11994135 is about 3463.2549718437. The cubic root of 11994135 is about 228.9055438267.
The spelling of 11994135 in words is "eleven million, nine hundred ninety-four thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •