Base | Representation |
---|---|
bin | 1001100110101111001101… |
… | …00110010101010101100001 |
3 | 2202210021011001000210102211 |
4 | 10303113212212111111201 |
5 | 10232031303042043402 |
6 | 112531225411442121 |
7 | 4310013243116365 |
oct | 463274646252541 |
9 | 82707131023384 |
10 | 21122223002977 |
11 | 6803980259098 |
12 | 24517658b6341 |
13 | ba2a811904c5 |
14 | 53046cd552a5 |
15 | 2696868154d7 |
hex | 1335e6995561 |
21122223002977 has 2 divisors, whose sum is σ = 21122223002978. Its totient is φ = 21122223002976.
The previous prime is 21122223002939. The next prime is 21122223002981. The reversal of 21122223002977 is 77920032222112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20165991310336 + 956231692641 = 4490656^2 + 977871^2 .
It is a cyclic number.
It is not a de Polignac number, because 21122223002977 - 231 = 21120075519329 is a prime.
It is a super-2 number, since 2×211222230029772 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21122223012977) 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, 10561111501488 + 10561111501489.
It is an arithmetic number, because the mean of its divisors is an integer number (10561111501489).
Almost surely, 221122223002977 is an apocalyptic number.
It is an amenable number.
21122223002977 is a deficient number, since it is larger than the sum of its proper divisors (1).
21122223002977 is an equidigital number, since it uses as much as digits as its factorization.
21122223002977 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84672, while the sum is 40.
The spelling of 21122223002977 in words is "twenty-one trillion, one hundred twenty-two billion, two hundred twenty-three million, two thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •