Base | Representation |
---|---|
bin | 11101101100000110101… |
… | …11000110101001111110 |
3 | 10121112002022001020010012 |
4 | 32312003113012221332 |
5 | 113203141421333042 |
6 | 2100344345343222 |
7 | 133462206313640 |
oct | 16660327065176 |
9 | 3545068036105 |
10 | 1020111121022 |
11 | 363699151874 |
12 | 145855197b12 |
13 | 752719abb56 |
14 | 375333b6890 |
15 | 1b807131e82 |
hex | ed835c6a7e |
1020111121022 has 16 divisors (see below), whose sum is σ = 1769831344512. Its totient is φ = 431923124760.
The previous prime is 1020111121021. The next prime is 1020111121031. The reversal of 1020111121022 is 2201211110201.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 1020111120988 and 1020111121006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020111121021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 438945104 + ... + 438947427.
It is an arithmetic number, because the mean of its divisors is an integer number (110614459032).
Almost surely, 21020111121022 is an apocalyptic number.
1020111121022 is a deficient number, since it is larger than the sum of its proper divisors (749720223490).
1020111121022 is an equidigital number, since it uses as much as digits as its factorization.
1020111121022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 877892623.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1020111121022 its reverse (2201211110201), we get a palindrome (3221322231223).
The spelling of 1020111121022 in words is "one trillion, twenty billion, one hundred eleven million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •