Base | Representation |
---|---|
bin | 110011101100000101… |
… | …1010010011001110110 |
3 | 101121111212000001200201 |
4 | 1213120023102121312 |
5 | 3304312230120042 |
6 | 122554305031114 |
7 | 11006465050114 |
oct | 1473013223166 |
9 | 347455001621 |
10 | 111001020022 |
11 | 43091200292 |
12 | 1961a02549a |
13 | a60ca03449 |
14 | 5530118ab4 |
15 | 2d49e2b1b7 |
hex | 19d82d2676 |
111001020022 has 8 divisors (see below), whose sum is σ = 176295737736. Its totient is φ = 52235774112.
The previous prime is 111001019999. The next prime is 111001020023. The reversal of 111001020022 is 220020100111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 111001019990 and 111001020008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111001020023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1632367908 + ... + 1632367975.
It is an arithmetic number, because the mean of its divisors is an integer number (22036967217).
Almost surely, 2111001020022 is an apocalyptic number.
111001020022 is a deficient number, since it is larger than the sum of its proper divisors (65294717714).
111001020022 is a wasteful number, since it uses less digits than its factorization.
111001020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3264735902.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 111001020022 its reverse (220020100111), we get a palindrome (331021120133).
The spelling of 111001020022 in words is "one hundred eleven billion, one million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •