Base | Representation |
---|---|
bin | 1001101001010100100101… |
… | …01110010011100110011101 |
3 | 2210002202022202122200000212 |
4 | 10310222102232103212131 |
5 | 10240010122042320333 |
6 | 113040111543502205 |
7 | 4316305414140263 |
oct | 464522256234635 |
9 | 83082282580025 |
10 | 21211010120093 |
11 | 68385a2274332 |
12 | 2466a04457965 |
13 | bab26092a4b1 |
14 | 534892b2c433 |
15 | 26bb3145e448 |
hex | 134a92b9399d |
21211010120093 has 2 divisors, whose sum is σ = 21211010120094. Its totient is φ = 21211010120092.
The previous prime is 21211010120087. The next prime is 21211010120137. The reversal of 21211010120093 is 39002101011212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12636731013124 + 8574279106969 = 3554818^2 + 2928187^2 .
It is a cyclic number.
It is not a de Polignac number, because 21211010120093 - 26 = 21211010120029 is a prime.
It is a super-3 number, since 3×212110101200933 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21211010120593) 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, 10605505060046 + 10605505060047.
It is an arithmetic number, because the mean of its divisors is an integer number (10605505060047).
Almost surely, 221211010120093 is an apocalyptic number.
It is an amenable number.
21211010120093 is a deficient number, since it is larger than the sum of its proper divisors (1).
21211010120093 is an equidigital number, since it uses as much as digits as its factorization.
21211010120093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 23.
The spelling of 21211010120093 in words is "twenty-one trillion, two hundred eleven billion, ten million, one hundred twenty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •