Base | Representation |
---|---|
bin | 10110111110000100000101… |
… | …101000001110011010101111 |
3 | 111020200121111021122000120211 |
4 | 112332010011220032122233 |
5 | 101220121044132400421 |
6 | 554504513030323251 |
7 | 30164412556411363 |
oct | 2676040550163257 |
9 | 436617437560524 |
10 | 101022020200111 |
11 | 2a20921a84535a |
12 | b3b68b21b9527 |
13 | 444a4494b6c9a |
14 | 1ad36c59772a3 |
15 | ba2c343049e1 |
hex | 5be105a0e6af |
101022020200111 has 4 divisors (see below), whose sum is σ = 101041413950800. Its totient is φ = 101002626449424.
The previous prime is 101022020200069. The next prime is 101022020200139. The reversal of 101022020200111 is 111002020220101.
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 101022020200111 - 213 = 101022020191919 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101022020200091 and 101022020200100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101022020260111) 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, 9696867531 + ... + 9696877948.
It is an arithmetic number, because the mean of its divisors is an integer number (25260353487700).
Almost surely, 2101022020200111 is an apocalyptic number.
101022020200111 is a deficient number, since it is larger than the sum of its proper divisors (19393750689).
101022020200111 is an equidigital number, since it uses as much as digits as its factorization.
101022020200111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19393750688.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101022020200111 its reverse (111002020220101), we get a palindrome (212024040420212).
The spelling of 101022020200111 in words is "one hundred one trillion, twenty-two billion, twenty million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •