Base | Representation |
---|---|
bin | 110010000001111001101110… |
… | …000100010111100110101101 |
3 | 1001212001221200120022222211210 |
4 | 302001321232010113212231 |
5 | 212320010111412304401 |
6 | 2055545435142505033 |
7 | 64226601246121635 |
oct | 6201715604274655 |
9 | 1055057616288753 |
10 | 220033021213101 |
11 | 64122531253548 |
12 | 20817a59735179 |
13 | 95a1042838865 |
14 | 3c499256556c5 |
15 | 1a6886cdd34d6 |
hex | c81e6e1179ad |
220033021213101 has 16 divisors (see below), whose sum is σ = 303192064327680. Its totient is φ = 141792295605360.
The previous prime is 220033021213067. The next prime is 220033021213123. The reversal of 220033021213101 is 101312120330022.
220033021213101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 220033021213101 - 211 = 220033021211053 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220033021213301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1370688261 + ... + 1370848778.
It is an arithmetic number, because the mean of its divisors is an integer number (18949504020480).
Almost surely, 2220033021213101 is an apocalyptic number.
It is an amenable number.
220033021213101 is a deficient number, since it is larger than the sum of its proper divisors (83159043114579).
220033021213101 is a wasteful number, since it uses less digits than its factorization.
220033021213101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2741537936.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 220033021213101 its reverse (101312120330022), we get a palindrome (321345141543123).
The spelling of 220033021213101 in words is "two hundred twenty trillion, thirty-three billion, twenty-one million, two hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •