Base | Representation |
---|---|
bin | 10000000000100100010… |
… | …000110010110100100011 |
3 | 10220011121020212220112021 |
4 | 100000210100302310203 |
5 | 121011021210310034 |
6 | 2201215501442311 |
7 | 142323666536662 |
oct | 20004420626443 |
9 | 3804536786467 |
10 | 1100120010019 |
11 | 39461607a328 |
12 | 159263b70397 |
13 | 7c982906914 |
14 | 3b3633c6dd9 |
15 | 1d93b2a96b4 |
hex | 10024432d23 |
1100120010019 has 4 divisors (see below), whose sum is σ = 1104924027760. Its totient is φ = 1095315992280.
The previous prime is 1100120009987. The next prime is 1100120010037. The reversal of 1100120010019 is 9100100210011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1100120010019 - 25 = 1100120009987 is a prime.
It is a super-2 number, since 2×11001200100192 (a number of 25 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 = 1100120009984 and 1100120010011.
It is not an unprimeable number, because it can be changed into a prime (1100120010049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2402008527 + ... + 2402008984.
It is an arithmetic number, because the mean of its divisors is an integer number (276231006940).
Almost surely, 21100120010019 is an apocalyptic number.
1100120010019 is a deficient number, since it is larger than the sum of its proper divisors (4804017741).
1100120010019 is an equidigital number, since it uses as much as digits as its factorization.
1100120010019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4804017740.
The product of its (nonzero) digits is 18, while the sum is 16.
The spelling of 1100120010019 in words is "one trillion, one hundred billion, one hundred twenty million, ten thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •