Base | Representation |
---|---|
bin | 10001110000011010111… |
… | …001100100101011000101 |
3 | 11022122121100222202120121 |
4 | 101300122321210223011 |
5 | 124443003313341401 |
6 | 2332321240301541 |
7 | 154105144653361 |
oct | 21603271445305 |
9 | 4278540882517 |
10 | 1220222012101 |
11 | 430547573094 |
12 | 1785a1a718b1 |
13 | 8b0b2c85b41 |
14 | 430b80c22a1 |
15 | 21b1a1acca1 |
hex | 11c1ae64ac5 |
1220222012101 has 8 divisors (see below), whose sum is σ = 1221761103264. Its totient is φ = 1218683076240.
The previous prime is 1220222011993. The next prime is 1220222012147. The reversal of 1220222012101 is 1012102220221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1220222012101 - 27 = 1220222011973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220222012201) 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 7 ways as a sum of consecutive naturals, for example, 31713591 + ... + 31752043.
It is an arithmetic number, because the mean of its divisors is an integer number (152720137908).
Almost surely, 21220222012101 is an apocalyptic number.
It is an amenable number.
1220222012101 is a deficient number, since it is larger than the sum of its proper divisors (1539091163).
1220222012101 is an equidigital number, since it uses as much as digits as its factorization.
1220222012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77651.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1220222012101 its reverse (1012102220221), we get a palindrome (2232324232322).
The spelling of 1220222012101 in words is "one trillion, two hundred twenty billion, two hundred twenty-two million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •