Base | Representation |
---|---|
bin | 11001000011101001101000… |
… | …010101000001011010111111 |
3 | 112110012012200100010012001111 |
4 | 121003221220111001122333 |
5 | 103421022214413101304 |
6 | 1030214035403422451 |
7 | 32132555550544363 |
oct | 3103515025013277 |
9 | 473165610105044 |
10 | 110202021222079 |
11 | 32128462023466 |
12 | 10439a81b24a27 |
13 | 4965010288417 |
14 | 1d2db406432a3 |
15 | cb191a33c704 |
hex | 643a685416bf |
110202021222079 has 2 divisors, whose sum is σ = 110202021222080. Its totient is φ = 110202021222078.
The previous prime is 110202021222061. The next prime is 110202021222107. The reversal of 110202021222079 is 970222120202011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110202021222079 - 217 = 110202021091007 is a prime.
It is a super-4 number, since 4×1102020212220794 (a number of 57 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110202021222079.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110202021322079) 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 as a sum of consecutive naturals, namely, 55101010611039 + 55101010611040.
It is an arithmetic number, because the mean of its divisors is an integer number (55101010611040).
Almost surely, 2110202021222079 is an apocalyptic number.
110202021222079 is a deficient number, since it is larger than the sum of its proper divisors (1).
110202021222079 is an equidigital number, since it uses as much as digits as its factorization.
110202021222079 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 31.
The spelling of 110202021222079 in words is "one hundred ten trillion, two hundred two billion, twenty-one million, two hundred twenty-two thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •