Base | Representation |
---|---|
bin | 110011101100010111… |
… | …0011000100000000111 |
3 | 101121112111022110202002 |
4 | 1213120232120200013 |
5 | 3304322104020124 |
6 | 122555234135515 |
7 | 11006636205245 |
oct | 1473056304007 |
9 | 347474273662 |
10 | 111010220039 |
11 | 43096414404 |
12 | 1962112159b |
13 | a6118a4b44 |
14 | 5531431795 |
15 | 2d4ab470ae |
hex | 19d8b98807 |
111010220039 has 2 divisors, whose sum is σ = 111010220040. Its totient is φ = 111010220038.
The previous prime is 111010219967. The next prime is 111010220051. The reversal of 111010220039 is 930022010111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111010220039 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111010220039.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111010220089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55505110019 + 55505110020.
It is an arithmetic number, because the mean of its divisors is an integer number (55505110020).
Almost surely, 2111010220039 is an apocalyptic number.
111010220039 is a deficient number, since it is larger than the sum of its proper divisors (1).
111010220039 is an equidigital number, since it uses as much as digits as its factorization.
111010220039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
The spelling of 111010220039 in words is "one hundred eleven billion, ten million, two hundred twenty thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •