Base | Representation |
---|---|
bin | 1011000111010011000011… |
… | …0001011011101100101101 |
3 | 1121021012221211022100001201 |
4 | 2301310300301123230231 |
5 | 3100203030024100442 |
6 | 41553442434205501 |
7 | 2400602666026441 |
oct | 261646061335455 |
9 | 47235854270051 |
10 | 12220000221997 |
11 | 3991522606897 |
12 | 1454399423891 |
13 | 6a8458463739 |
14 | 303646002821 |
15 | 162d0c1567b7 |
hex | b1d30c5bb2d |
12220000221997 has 2 divisors, whose sum is σ = 12220000221998. Its totient is φ = 12220000221996.
The previous prime is 12220000221977. The next prime is 12220000222021. The reversal of 12220000221997 is 79912200002221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7289384412996 + 4930615809001 = 2699886^2 + 2220499^2 .
It is a cyclic number.
It is not a de Polignac number, because 12220000221997 - 235 = 12185640483629 is a prime.
It is a super-3 number, since 3×122200002219973 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12220000221977) 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, 6110000110998 + 6110000110999.
It is an arithmetic number, because the mean of its divisors is an integer number (6110000110999).
Almost surely, 212220000221997 is an apocalyptic number.
It is an amenable number.
12220000221997 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220000221997 is an equidigital number, since it uses as much as digits as its factorization.
12220000221997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 37.
The spelling of 12220000221997 in words is "twelve trillion, two hundred twenty billion, two hundred twenty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •