Base | Representation |
---|---|
bin | 101111111111111011011011… |
… | …111110100100001111011001 |
3 | 1000200110002102212121011112101 |
4 | 233333323123332210033121 |
5 | 210132141012300210243 |
6 | 2024550340315243401 |
7 | 62315365554545365 |
oct | 5777733376441731 |
9 | 1020402385534471 |
10 | 211101333210073 |
11 | 61299633218869 |
12 | 1b814a29449561 |
13 | 90a3a02487767 |
14 | 3a1b5053042a5 |
15 | 196136ba3354d |
hex | bffedbfa43d9 |
211101333210073 has 2 divisors, whose sum is σ = 211101333210074. Its totient is φ = 211101333210072.
The previous prime is 211101333210071. The next prime is 211101333210113. The reversal of 211101333210073 is 370012333101112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107793461463769 + 103307871746304 = 10382363^2 + 10164048^2 .
It is a cyclic number.
It is not a de Polignac number, because 211101333210073 - 21 = 211101333210071 is a prime.
Together with 211101333210071, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (211101333210071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105550666605036 + 105550666605037.
It is an arithmetic number, because the mean of its divisors is an integer number (105550666605037).
Almost surely, 2211101333210073 is an apocalyptic number.
It is an amenable number.
211101333210073 is a deficient number, since it is larger than the sum of its proper divisors (1).
211101333210073 is an equidigital number, since it uses as much as digits as its factorization.
211101333210073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2268, while the sum is 28.
Adding to 211101333210073 its reverse (370012333101112), we get a palindrome (581113666311185).
The spelling of 211101333210073 in words is "two hundred eleven trillion, one hundred one billion, three hundred thirty-three million, two hundred ten thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •