Base | Representation |
---|---|
bin | 1001100011110100111001… |
… | …10101011100000101010001 |
3 | 2202102200222100100210110122 |
4 | 10301322130311130011101 |
5 | 10223411432001412402 |
6 | 112413244345240025 |
7 | 4266542512615244 |
oct | 461723465340521 |
9 | 82380870323418 |
10 | 21022201200977 |
11 | 6775513591909 |
12 | 24362b0793015 |
13 | b96500cb9392 |
14 | 5296a105b25b |
15 | 266c80720ca2 |
hex | 131e9cd5c151 |
21022201200977 has 2 divisors, whose sum is σ = 21022201200978. Its totient is φ = 21022201200976.
The previous prime is 21022201200971. The next prime is 21022201201013. The reversal of 21022201200977 is 77900210222012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19741884057856 + 1280317143121 = 4443184^2 + 1131511^2 .
It is a cyclic number.
It is not a de Polignac number, because 21022201200977 - 224 = 21022184423761 is a prime.
It is a super-2 number, since 2×210222012009772 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21022201200971) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10511100600488 + 10511100600489.
It is an arithmetic number, because the mean of its divisors is an integer number (10511100600489).
Almost surely, 221022201200977 is an apocalyptic number.
It is an amenable number.
21022201200977 is a deficient number, since it is larger than the sum of its proper divisors (1).
21022201200977 is an equidigital number, since it uses as much as digits as its factorization.
21022201200977 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14112, while the sum is 35.
Adding to 21022201200977 its reverse (77900210222012), we get a palindrome (98922411422989).
The spelling of 21022201200977 in words is "twenty-one trillion, twenty-two billion, two hundred one million, two hundred thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •