Base | Representation |
---|---|
bin | 11110111000100011101… |
… | …010001111001110001101 |
3 | 21111220001120200021201021 |
4 | 132320203222033032031 |
5 | 234232443400303211 |
6 | 4302550550114141 |
7 | 306221605235512 |
oct | 36704352171615 |
9 | 7456046607637 |
10 | 2122312119181 |
11 | 749081954301 |
12 | 2a339a04b951 |
13 | 125196777ba7 |
14 | 74a12cdb309 |
15 | 3a315e4a771 |
hex | 1ee23a8f38d |
2122312119181 has 2 divisors, whose sum is σ = 2122312119182. Its totient is φ = 2122312119180.
The previous prime is 2122312119139. The next prime is 2122312119199. The reversal of 2122312119181 is 1819112132212.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2121855442281 + 456676900 = 1456659^2 + 21370^2 .
It is a cyclic number.
It is not a de Polignac number, because 2122312119181 - 221 = 2122310022029 is a prime.
It is a super-2 number, since 2×21223121191812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2122312119281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1061156059590 + 1061156059591.
It is an arithmetic number, because the mean of its divisors is an integer number (1061156059591).
Almost surely, 22122312119181 is an apocalyptic number.
It is an amenable number.
2122312119181 is a deficient number, since it is larger than the sum of its proper divisors (1).
2122312119181 is an equidigital number, since it uses as much as digits as its factorization.
2122312119181 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3456, while the sum is 34.
The spelling of 2122312119181 in words is "two trillion, one hundred twenty-two billion, three hundred twelve million, one hundred nineteen thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •