Base | Representation |
---|---|
bin | 1011000111010011000011… |
… | …0100110110111011100001 |
3 | 1121021012221212222221211221 |
4 | 2301310300310312323201 |
5 | 3100203030241314334 |
6 | 41553442505335041 |
7 | 2400603006456436 |
oct | 261646064667341 |
9 | 47235855887757 |
10 | 12220001119969 |
11 | 399152306a515 |
12 | 1454399797481 |
13 | 6a84586b9396 |
14 | 303646197b8d |
15 | 162d0c2828b4 |
hex | b1d30d36ee1 |
12220001119969 has 2 divisors, whose sum is σ = 12220001119970. Its totient is φ = 12220001119968.
The previous prime is 12220001119867. The next prime is 12220001120039. The reversal of 12220001119969 is 96991110002221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12218778918369 + 1222201600 = 3495537^2 + 34960^2 .
It is a cyclic number.
It is not a de Polignac number, because 12220001119969 - 213 = 12220001111777 is a prime.
It is a super-2 number, since 2×122200011199692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12220001119169) 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, 6110000559984 + 6110000559985.
It is an arithmetic number, because the mean of its divisors is an integer number (6110000559985).
Almost surely, 212220001119969 is an apocalyptic number.
It is an amenable number.
12220001119969 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220001119969 is an equidigital number, since it uses as much as digits as its factorization.
12220001119969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 43.
The spelling of 12220001119969 in words is "twelve trillion, two hundred twenty billion, one million, one hundred nineteen thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •