Base | Representation |
---|---|
bin | 10001110010001110110… |
… | …100000001010111010101 |
3 | 11022211121220021211210221 |
4 | 101302032310001113111 |
5 | 130010444134320223 |
6 | 2333242230114341 |
7 | 154204300442563 |
oct | 21621664012725 |
9 | 4284556254727 |
10 | 1222166713813 |
11 | 431355280291 |
12 | 178a451ab9b1 |
13 | 8b332b3b306 |
14 | 432204a4a33 |
15 | 21bd0c9ab5d |
hex | 11c8ed015d5 |
1222166713813 has 2 divisors, whose sum is σ = 1222166713814. Its totient is φ = 1222166713812.
The previous prime is 1222166713751. The next prime is 1222166713909. The reversal of 1222166713813 is 3183176612221.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 909213739729 + 312952974084 = 953527^2 + 559422^2 .
It is a cyclic number.
It is not a de Polignac number, because 1222166713813 - 233 = 1213576779221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1222166713813.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1222166713513) 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 as a sum of consecutive naturals, namely, 611083356906 + 611083356907.
It is an arithmetic number, because the mean of its divisors is an integer number (611083356907).
Almost surely, 21222166713813 is an apocalyptic number.
It is an amenable number.
1222166713813 is a deficient number, since it is larger than the sum of its proper divisors (1).
1222166713813 is an equidigital number, since it uses as much as digits as its factorization.
1222166713813 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 145152, while the sum is 43.
The spelling of 1222166713813 in words is "one trillion, two hundred twenty-two billion, one hundred sixty-six million, seven hundred thirteen thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •