Base | Representation |
---|---|
bin | 1010000110001010011101… |
… | …0001111110111001100011 |
3 | 1110022020121220201222221000 |
4 | 2201202213101332321203 |
5 | 2423334323003031034 |
6 | 35335421355003043 |
7 | 2224010115061446 |
oct | 241424721767143 |
9 | 43266556658830 |
10 | 11101002002019 |
11 | 359a9aa255a56 |
12 | 12b3547139483 |
13 | 626a876c1ca7 |
14 | 2a541170565d |
15 | 143b6886d599 |
hex | a18a747ee63 |
11101002002019 has 16 divisors (see below), whose sum is σ = 16537805596800. Its totient is φ = 7359323484168.
The previous prime is 11101002002003. The next prime is 11101002002023. The reversal of 11101002002019 is 91020020010111.
It is a happy number.
It is not a de Polignac number, because 11101002002019 - 24 = 11101002002003 is a prime.
It is a super-2 number, since 2×111010020020192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11101002001992 and 11101002002010.
It is not an unprimeable number, because it can be changed into a prime (11101002000019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1148453889 + ... + 1148463554.
It is an arithmetic number, because the mean of its divisors is an integer number (1033612849800).
Almost surely, 211101002002019 is an apocalyptic number.
11101002002019 is a deficient number, since it is larger than the sum of its proper divisors (5436803594781).
11101002002019 is a wasteful number, since it uses less digits than its factorization.
11101002002019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2296917631 (or 2296917625 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
The spelling of 11101002002019 in words is "eleven trillion, one hundred one billion, two million, two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •