Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …00111101000100111000001 |
3 | 2121220002210112200220220211 |
4 | 10203113020013220213001 |
5 | 10111020431200324301 |
6 | 110330023253234121 |
7 | 4134361532012413 |
oct | 443271007504701 |
9 | 77802715626824 |
10 | 20022200011201 |
11 | 641a404a24033 |
12 | 22b452a332941 |
13 | b231156c513b |
14 | 4d31187c49b3 |
15 | 24ac53d22051 |
hex | 1235c81e89c1 |
20022200011201 has 2 divisors, whose sum is σ = 20022200011202. Its totient is φ = 20022200011200.
The previous prime is 20022200011147. The next prime is 20022200011211. The reversal of 20022200011201 is 10211000222002.
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., 18575893120576 + 1446306890625 = 4309976^2 + 1202625^2 .
It is a cyclic number.
It is not a de Polignac number, because 20022200011201 - 223 = 20022191622593 is a prime.
It is not a weakly prime, because it can be changed into another prime (20022200011211) 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, 10011100005600 + 10011100005601.
It is an arithmetic number, because the mean of its divisors is an integer number (10011100005601).
Almost surely, 220022200011201 is an apocalyptic number.
It is an amenable number.
20022200011201 is a deficient number, since it is larger than the sum of its proper divisors (1).
20022200011201 is an equidigital number, since it uses as much as digits as its factorization.
20022200011201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20022200011201 its reverse (10211000222002), we get a palindrome (30233200233203).
The spelling of 20022200011201 in words is "twenty trillion, twenty-two billion, two hundred million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •