Base | Representation |
---|---|
bin | 1010000000010010100100… |
… | …10010101110110001100001 |
3 | 2212220012100222112112100021 |
4 | 11000021102102232301201 |
5 | 10340422404000211001 |
6 | 114442430452553441 |
7 | 4430314354100353 |
oct | 500112222566141 |
9 | 85805328475307 |
10 | 22000203132001 |
11 | 701226313aa06 |
12 | 2573953622881 |
13 | c377c195ab53 |
14 | 560b5baa70d3 |
15 | 282420adaba1 |
hex | 1402524aec61 |
22000203132001 has 2 divisors, whose sum is σ = 22000203132002. Its totient is φ = 22000203132000.
The previous prime is 22000203131999. The next prime is 22000203132023. The reversal of 22000203132001 is 10023130200022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21994449150976 + 5753981025 = 4689824^2 + 75855^2 .
It is a cyclic number.
It is not a de Polignac number, because 22000203132001 - 21 = 22000203131999 is a prime.
Together with 22000203131999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (22000203132041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11000101566000 + 11000101566001.
It is an arithmetic number, because the mean of its divisors is an integer number (11000101566001).
Almost surely, 222000203132001 is an apocalyptic number.
It is an amenable number.
22000203132001 is a deficient number, since it is larger than the sum of its proper divisors (1).
22000203132001 is an equidigital number, since it uses as much as digits as its factorization.
22000203132001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 22000203132001 its reverse (10023130200022), we get a palindrome (32023333332023).
The spelling of 22000203132001 in words is "twenty-two trillion, two hundred three million, one hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •