Base | Representation |
---|---|
bin | 1001100011110100101101… |
… | …01011011000110111011101 |
3 | 2202102200201010222201101012 |
4 | 10301322112223120313131 |
5 | 10223411224030344234 |
6 | 112413230215225005 |
7 | 4266540116606204 |
oct | 461722653306735 |
9 | 82380633881335 |
10 | 21022097903069 |
11 | 677547024863a |
12 | 2436282078165 |
13 | b964b578c763 |
14 | 52969144c23b |
15 | 266c766190ce |
hex | 131e96ad8ddd |
21022097903069 has 2 divisors, whose sum is σ = 21022097903070. Its totient is φ = 21022097903068.
The previous prime is 21022097903063. The next prime is 21022097903071. The reversal of 21022097903069 is 96030979022012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17966111436025 + 3055986467044 = 4238645^2 + 1748138^2 .
It is a cyclic number.
It is not a de Polignac number, because 21022097903069 - 212 = 21022097898973 is a prime.
It is a super-2 number, since 2×210220979030692 (a number of 27 digits) contains 22 as substring.
Together with 21022097903071, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21022097903063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10511048951534 + 10511048951535.
It is an arithmetic number, because the mean of its divisors is an integer number (10511048951535).
Almost surely, 221022097903069 is an apocalyptic number.
It is an amenable number.
21022097903069 is a deficient number, since it is larger than the sum of its proper divisors (1).
21022097903069 is an equidigital number, since it uses as much as digits as its factorization.
21022097903069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 734832, while the sum is 50.
The spelling of 21022097903069 in words is "twenty-one trillion, twenty-two billion, ninety-seven million, nine hundred three thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •