Base | Representation |
---|---|
bin | 101101000010… |
… | …100100101011 |
3 | 211012212012000 |
4 | 231002210223 |
5 | 11010311034 |
6 | 1101022043 |
7 | 202233540 |
oct | 55024453 |
9 | 24185160 |
10 | 11807019 |
11 | 6734874 |
12 | 3b54923 |
13 | 25a5203 |
14 | 17d4bc7 |
15 | 1083599 |
hex | b4292b |
11807019 has 32 divisors (see below), whose sum is σ = 20160000. Its totient is φ = 6689952.
The previous prime is 11807017. The next prime is 11807023. The reversal of 11807019 is 91070811.
11807019 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11807019 - 21 = 11807017 is a prime.
It is a super-2 number, since 2×118070192 = 278811395332722, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 11806983 and 11807001.
It is not an unprimeable number, because it can be changed into a prime (11807017) 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 31 ways as a sum of consecutive naturals, for example, 33657 + ... + 34005.
It is an arithmetic number, because the mean of its divisors is an integer number (630000).
Almost surely, 211807019 is an apocalyptic number.
11807019 is a deficient number, since it is larger than the sum of its proper divisors (8352981).
11807019 is a wasteful number, since it uses less digits than its factorization.
11807019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 544 (or 538 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 27.
The square root of 11807019 is about 3436.1343105298. The cubic root of 11807019 is about 227.7089430092.
The spelling of 11807019 in words is "eleven million, eight hundred seven thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •