Base | Representation |
---|---|
bin | 1001100110101110110110… |
… | …01010010010110000011001 |
3 | 2202210020122122221021011022 |
4 | 10303113123022102300121 |
5 | 10232030404430244001 |
6 | 112531154354412225 |
7 | 4310005423026263 |
oct | 463273312226031 |
9 | 82706578837138 |
10 | 21122031103001 |
11 | 68038919a8874 |
12 | 2451711591075 |
13 | ba2a504b101a |
14 | 530451680b33 |
15 | 269674a5b11b |
hex | 1335db292c19 |
21122031103001 has 2 divisors, whose sum is σ = 21122031103002. Its totient is φ = 21122031103000.
The previous prime is 21122031102973. The next prime is 21122031103009. The reversal of 21122031103001 is 10030113022112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13925017677376 + 7197013425625 = 3731624^2 + 2682725^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21122031103001 is a prime.
It is a super-2 number, since 2×211220311030012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21122031103009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10561015551500 + 10561015551501.
It is an arithmetic number, because the mean of its divisors is an integer number (10561015551501).
Almost surely, 221122031103001 is an apocalyptic number.
It is an amenable number.
21122031103001 is a deficient number, since it is larger than the sum of its proper divisors (1).
21122031103001 is an equidigital number, since it uses as much as digits as its factorization.
21122031103001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 21122031103001 its reverse (10030113022112), we get a palindrome (31152144125113).
The spelling of 21122031103001 in words is "twenty-one trillion, one hundred twenty-two billion, thirty-one million, one hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •