Base | Representation |
---|---|
bin | 1011000111010011000111… |
… | …1101101100000111101001 |
3 | 1121021020000012220221110122 |
4 | 2301310301331230013221 |
5 | 3100203100133242301 |
6 | 41553444430453025 |
7 | 2400603330655064 |
oct | 261646175540751 |
9 | 47236005827418 |
10 | 12220020212201 |
11 | 399153291a81a |
12 | 14543a4064175 |
13 | 6a845c642569 |
14 | 3036489278db |
15 | 162d0dca481b |
hex | b1d31f6c1e9 |
12220020212201 has 2 divisors, whose sum is σ = 12220020212202. Its totient is φ = 12220020212200.
The previous prime is 12220020212143. The next prime is 12220020212221. The reversal of 12220020212201 is 10221202002221.
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., 6433705425625 + 5786314786576 = 2536475^2 + 2405476^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12220020212201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12220020212201.
It is not a weakly prime, because it can be changed into another prime (12220020212221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110010106100 + 6110010106101.
It is an arithmetic number, because the mean of its divisors is an integer number (6110010106101).
Almost surely, 212220020212201 is an apocalyptic number.
It is an amenable number.
12220020212201 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220020212201 is an equidigital number, since it uses as much as digits as its factorization.
12220020212201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 12220020212201 its reverse (10221202002221), we get a palindrome (22441222214422).
The spelling of 12220020212201 in words is "twelve trillion, two hundred twenty billion, twenty million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •