Base | Representation |
---|---|
bin | 10100100001101100… |
… | …11011011110001111 |
3 | 1001110000022012102122 |
4 | 22100312123132033 |
5 | 140032122400444 |
6 | 5021303243155 |
7 | 540042330365 |
oct | 122066333617 |
9 | 31400265378 |
10 | 11020121999 |
11 | 4745631847 |
12 | 21767494bb |
13 | 1068151463 |
14 | 76782b635 |
15 | 4477164ee |
hex | 290d9b78f |
11020121999 has 8 divisors (see below), whose sum is σ = 11631235440. Its totient is φ = 10412119296.
The previous prime is 11020121989. The next prime is 11020122023. The reversal of 11020121999 is 99912102011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11020121999 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 (11020121909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 770402 + ... + 784575.
It is an arithmetic number, because the mean of its divisors is an integer number (1453904430).
Almost surely, 211020121999 is an apocalyptic number.
11020121999 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
11020121999 is a deficient number, since it is larger than the sum of its proper divisors (611113441).
11020121999 is a wasteful number, since it uses less digits than its factorization.
11020121999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1555369.
The product of its (nonzero) digits is 2916, while the sum is 35.
It can be divided in two parts, 1102012 and 1999, that added together give a palindrome (1104011).
The spelling of 11020121999 in words is "eleven billion, twenty million, one hundred twenty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •