Base | Representation |
---|---|
bin | 1001101001010100110000… |
… | …01101001110010011111101 |
3 | 2210002202120011202021210111 |
4 | 10310222120031032103331 |
5 | 10240010314120022343 |
6 | 113040125031310021 |
7 | 4316310612064255 |
oct | 464523015162375 |
9 | 83082504667714 |
10 | 21211102110973 |
11 | 683863a195455 |
12 | 2466a2b21b311 |
13 | bab2769c8678 |
14 | 5348a1036965 |
15 | 26bb39580c9d |
hex | 134a9834e4fd |
21211102110973 has 2 divisors, whose sum is σ = 21211102110974. Its totient is φ = 21211102110972.
The previous prime is 21211102110971. The next prime is 21211102111027. The reversal of 21211102110973 is 37901120111212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21078869515929 + 132232595044 = 4591173^2 + 363638^2 .
It is a cyclic number.
It is not a de Polignac number, because 21211102110973 - 21 = 21211102110971 is a prime.
Together with 21211102110971, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21211102110971) 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, 10605551055486 + 10605551055487.
It is an arithmetic number, because the mean of its divisors is an integer number (10605551055487).
Almost surely, 221211102110973 is an apocalyptic number.
It is an amenable number.
21211102110973 is a deficient number, since it is larger than the sum of its proper divisors (1).
21211102110973 is an equidigital number, since it uses as much as digits as its factorization.
21211102110973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 31.
The spelling of 21211102110973 in words is "twenty-one trillion, two hundred eleven billion, one hundred two million, one hundred ten thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •