Base | Representation |
---|---|
bin | 11101101100000101101… |
… | …01001001100101001111 |
3 | 10121112001200022000100211 |
4 | 32312002311021211033 |
5 | 113203132132020421 |
6 | 2100343430503251 |
7 | 133462040542522 |
oct | 16660265114517 |
9 | 3545050260324 |
10 | 1020102220111 |
11 | 363694122447 |
12 | 145852204b27 |
13 | 7526cbb3640 |
14 | 3753213abb9 |
15 | 1b8064749e1 |
hex | ed82d4994f |
1020102220111 has 8 divisors (see below), whose sum is σ = 1099280856800. Its totient is φ = 941024902752.
The previous prime is 1020102220103. The next prime is 1020102220121. The reversal of 1020102220111 is 1110222010201.
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 1020102220111 - 23 = 1020102220103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020102220091 and 1020102220100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020102220121) 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, 25308915 + ... + 25349188.
It is an arithmetic number, because the mean of its divisors is an integer number (137410107100).
Almost surely, 21020102220111 is an apocalyptic number.
1020102220111 is a deficient number, since it is larger than the sum of its proper divisors (79178636689).
1020102220111 is a wasteful number, since it uses less digits than its factorization.
1020102220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50659665.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1020102220111 its reverse (1110222010201), we get a palindrome (2130324230312).
The spelling of 1020102220111 in words is "one trillion, twenty billion, one hundred two million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •