Base | Representation |
---|---|
bin | 10110111111001110100100… |
… | …111011011010101111110011 |
3 | 111020222020221100220121112110 |
4 | 112333032210323122233303 |
5 | 101222423400032020034 |
6 | 555005341342500403 |
7 | 30203243602356033 |
oct | 2677164473325763 |
9 | 436866840817473 |
10 | 101102002220019 |
11 | 2a23a133590759 |
12 | b40a2b3b94703 |
13 | 4454b54994b98 |
14 | 1ad75121918c3 |
15 | ba4d65e20de9 |
hex | 5bf3a4edabf3 |
101102002220019 has 32 divisors (see below), whose sum is σ = 138776763477760. Its totient is φ = 65423126950272.
The previous prime is 101102002219973. The next prime is 101102002220029. The reversal of 101102002220019 is 910022200201101.
It is not a de Polignac number, because 101102002220019 - 27 = 101102002219891 is a prime.
It is a super-2 number, since 2×1011020022200192 (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 = 101102002219977 and 101102002220004.
It is not an unprimeable number, because it can be changed into a prime (101102002220029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 108157332 + ... + 109088094.
It is an arithmetic number, because the mean of its divisors is an integer number (4336773858680).
Almost surely, 2101102002220019 is an apocalyptic number.
101102002220019 is a deficient number, since it is larger than the sum of its proper divisors (37674761257741).
101102002220019 is a wasteful number, since it uses less digits than its factorization.
101102002220019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 933139.
The product of its (nonzero) digits is 144, while the sum is 21.
The spelling of 101102002220019 in words is "one hundred one trillion, one hundred two billion, two million, two hundred twenty thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •