Base | Representation |
---|---|
bin | 10100100001101011… |
… | …11101111110111001 |
3 | 1001110000002001201221 |
4 | 22100311331332321 |
5 | 140032110014314 |
6 | 5021300512041 |
7 | 540041315260 |
oct | 122065757671 |
9 | 31400061657 |
10 | 11020001209 |
11 | 474555a018 |
12 | 21766ab621 |
13 | 106810b499 |
14 | 7677d95d7 |
15 | 4476e0824 |
hex | 290d7dfb9 |
11020001209 has 8 divisors (see below), whose sum is σ = 12716562560. Its totient is φ = 9354008736.
The previous prime is 11020001207. The next prime is 11020001219. The reversal of 11020001209 is 90210002011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11020001209 - 21 = 11020001207 is a prime.
It is a super-2 number, since 2×110200012092 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11020001192 and 11020001201.
It is not an unprimeable number, because it can be changed into a prime (11020001207) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7641444 + ... + 7642885.
It is an arithmetic number, because the mean of its divisors is an integer number (1589570320).
Almost surely, 211020001209 is an apocalyptic number.
It is an amenable number.
11020001209 is a deficient number, since it is larger than the sum of its proper divisors (1696561351).
11020001209 is a wasteful number, since it uses less digits than its factorization.
11020001209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15284439.
The product of its (nonzero) digits is 36, while the sum is 16.
The spelling of 11020001209 in words is "eleven billion, twenty million, one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •