Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …010100100010100101001011 |
3 | 111010110112000120101011010210 |
4 | 112300303221110202211023 |
5 | 101110204323111223034 |
6 | 552530210351412203 |
7 | 30041532131312235 |
oct | 2660635124424513 |
9 | 433415016334123 |
10 | 100111012211019 |
11 | 29997929560417 |
12 | b28a227524063 |
13 | 43b2574267084 |
14 | 1aa1582601255 |
15 | b891b56ab8e9 |
hex | 5b0ce952294b |
100111012211019 has 8 divisors (see below), whose sum is σ = 133495844314320. Its totient is φ = 66733427457536.
The previous prime is 100111012211011. The next prime is 100111012211051. The reversal of 100111012211019 is 910112210111001.
It is a happy number.
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 100111012211019 - 23 = 100111012211011 is a prime.
It is a super-2 number, since 2×1001110122110192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100111012210986 and 100111012211004.
It is not an unprimeable number, because it can be changed into a prime (100111012211011) 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, 1811805222 + ... + 1811860475.
It is an arithmetic number, because the mean of its divisors is an integer number (16686980539290).
Almost surely, 2100111012211019 is an apocalyptic number.
100111012211019 is a deficient number, since it is larger than the sum of its proper divisors (33384832103301).
100111012211019 is an equidigital number, since it uses as much as digits as its factorization.
100111012211019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3623674909.
The product of its (nonzero) digits is 36, while the sum is 21.
The spelling of 100111012211019 in words is "one hundred trillion, one hundred eleven billion, twelve million, two hundred eleven thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •