Base | Representation |
---|---|
bin | 10001011111101010000… |
… | …001000011110111010101 |
3 | 11020221010220211112021022 |
4 | 101133222001003313111 |
5 | 124144122314201401 |
6 | 2320143154130525 |
7 | 152600116402412 |
oct | 21375201036725 |
9 | 4227126745238 |
10 | 1202222022101 |
11 | 42394aa981a1 |
12 | 174bb9880a45 |
13 | 894a4a59c99 |
14 | 4228b699109 |
15 | 21414d0771b |
hex | 117ea043dd5 |
1202222022101 has 8 divisors (see below), whose sum is σ = 1215004801920. Its totient is φ = 1189460602512.
The previous prime is 1202222022047. The next prime is 1202222022173. The reversal of 1202222022101 is 1012202222021.
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 1202222022101 - 238 = 927344115157 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1202222022101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1202222022181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5226881 + ... + 5452038.
It is an arithmetic number, because the mean of its divisors is an integer number (151875600240).
Almost surely, 21202222022101 is an apocalyptic number.
It is an amenable number.
1202222022101 is a deficient number, since it is larger than the sum of its proper divisors (12782779819).
1202222022101 is a wasteful number, since it uses less digits than its factorization.
1202222022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10680115.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 1202222022101 its reverse (1012202222021), we get a palindrome (2214424244122).
The spelling of 1202222022101 in words is "one trillion, two hundred two billion, two hundred twenty-two million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •