Base | Representation |
---|---|
bin | 1001100110101100111011… |
… | …10100111000101100000101 |
3 | 2202210010222221122112101102 |
4 | 10303112131310320230011 |
5 | 10232021303013043104 |
6 | 112530504315105445 |
7 | 4306641056342234 |
oct | 463263564705405 |
9 | 82703887575342 |
10 | 21121002081029 |
11 | 6803404062394 |
12 | 2451484a42285 |
13 | ba2918252096 |
14 | 530394b3ab1b |
15 | 269614545a1e |
hex | 13359dd38b05 |
21121002081029 has 2 divisors, whose sum is σ = 21121002081030. Its totient is φ = 21121002081028.
The previous prime is 21121002080977. The next prime is 21121002081041. The reversal of 21121002081029 is 92018020012112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16466187201025 + 4654814880004 = 4057855^2 + 2157502^2 .
It is a cyclic number.
It is not a de Polignac number, because 21121002081029 - 228 = 21120733645573 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21121002080992 and 21121002081010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21121002084029) 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, 10560501040514 + 10560501040515.
It is an arithmetic number, because the mean of its divisors is an integer number (10560501040515).
Almost surely, 221121002081029 is an apocalyptic number.
It is an amenable number.
21121002081029 is a deficient number, since it is larger than the sum of its proper divisors (1).
21121002081029 is an equidigital number, since it uses as much as digits as its factorization.
21121002081029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 29.
The spelling of 21121002081029 in words is "twenty-one trillion, one hundred twenty-one billion, two million, eighty-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •