Base | Representation |
---|---|
bin | 10001110010010001111… |
… | …111110000000000111010 |
3 | 11022211202121210011111101 |
4 | 101302101333300000322 |
5 | 130011101322320442 |
6 | 2333251414522014 |
7 | 154205516415241 |
oct | 21622177600072 |
9 | 4284677704441 |
10 | 1222220120122 |
11 | 431382438231 |
12 | 178a5b06630a |
13 | 8b340c19c91 |
14 | 43227607958 |
15 | 21bd57e9cb7 |
hex | 11c91ff003a |
1222220120122 has 8 divisors (see below), whose sum is σ = 1833797520576. Its totient is φ = 610954279932.
The previous prime is 1222220120087. The next prime is 1222220120123. The reversal of 1222220120122 is 2210210222221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×12222201201222 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1222220120122.
It is not an unprimeable number, because it can be changed into a prime (1222220120123) 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 3 ways as a sum of consecutive naturals, for example, 77880258 + ... + 77895949.
It is an arithmetic number, because the mean of its divisors is an integer number (229224690072).
Almost surely, 21222220120122 is an apocalyptic number.
1222220120122 is a deficient number, since it is larger than the sum of its proper divisors (611577400454).
1222220120122 is a wasteful number, since it uses less digits than its factorization.
1222220120122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155780132.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 1222220120122 its reverse (2210210222221), we get a palindrome (3432430342343).
The spelling of 1222220120122 in words is "one trillion, two hundred twenty-two billion, two hundred twenty million, one hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •