Base | Representation |
---|---|
bin | 1010000000110111110111… |
… | …0000010111010010110101 |
3 | 1102222120000120022012111021 |
4 | 2200031331300113102311 |
5 | 2420342201404304343 |
6 | 35225550345341141 |
7 | 2214311546304445 |
oct | 240157560272265 |
9 | 42876016265437 |
10 | 11010111009973 |
11 | 35653a86a53a9 |
12 | 12999bba977b1 |
13 | 61b33110b4aa |
14 | 2a0c6c354125 |
15 | 1415e91940ed |
hex | a037dc174b5 |
11010111009973 has 2 divisors, whose sum is σ = 11010111009974. Its totient is φ = 11010111009972.
The previous prime is 11010111009971. The next prime is 11010111010009. The reversal of 11010111009973 is 37990011101011.
It is a happy number.
11010111009973 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6037822011204 + 4972288998769 = 2457198^2 + 2229863^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010111009973 - 21 = 11010111009971 is a prime.
Together with 11010111009971, 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 (11010111009971) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505055504986 + 5505055504987.
It is an arithmetic number, because the mean of its divisors is an integer number (5505055504987).
Almost surely, 211010111009973 is an apocalyptic number.
It is an amenable number.
11010111009973 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010111009973 is an equidigital number, since it uses as much as digits as its factorization.
11010111009973 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1701, while the sum is 34.
The spelling of 11010111009973 in words is "eleven trillion, ten billion, one hundred eleven million, nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •