Base | Representation |
---|---|
bin | 10110111111011111010110… |
… | …011001101010100110000011 |
3 | 111021000222102111200102010010 |
4 | 112333133112121222212003 |
5 | 101223222241044231034 |
6 | 555021520421040003 |
7 | 30204452111006451 |
oct | 2677372631524603 |
9 | 437028374612103 |
10 | 101120012102019 |
11 | 2a246835702659 |
12 | b41189b556003 |
13 | 4456764c753b1 |
14 | 1ad83400319d1 |
15 | ba556c0cc3e9 |
hex | 5bf7d666a983 |
101120012102019 has 4 divisors (see below), whose sum is σ = 134826682802696. Its totient is φ = 67413341401344.
The previous prime is 101120012101993. The next prime is 101120012102023. The reversal of 101120012102019 is 910201210021101.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 101120012102019 - 228 = 101119743666563 is a prime.
It is a super-2 number, since 2×1011200121020192 (a number of 29 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 = 101120012101986 and 101120012102004.
It is not an unprimeable number, because it can be changed into a prime (101120012102719) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16853335350334 + ... + 16853335350339.
It is an arithmetic number, because the mean of its divisors is an integer number (33706670700674).
Almost surely, 2101120012102019 is an apocalyptic number.
101120012102019 is a deficient number, since it is larger than the sum of its proper divisors (33706670700677).
101120012102019 is an equidigital number, since it uses as much as digits as its factorization.
101120012102019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33706670700676.
The product of its (nonzero) digits is 72, while the sum is 21.
The spelling of 101120012102019 in words is "one hundred one trillion, one hundred twenty billion, twelve million, one hundred two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •