Base | Representation |
---|---|
bin | 101111110010111110010111… |
… | …010000110000010110001001 |
3 | 1000120021222122112101020101021 |
4 | 233302332113100300112021 |
5 | 210023044334230320243 |
6 | 2023025353434152441 |
7 | 62164152366253144 |
oct | 5762762720602611 |
9 | 1016258575336337 |
10 | 210211122120073 |
11 | 60a86044275a38 |
12 | 1b6b03a7582721 |
13 | 903aa92a4aab9 |
14 | 39ca3b601305b |
15 | 1948118ab96ed |
hex | bf2f97430589 |
210211122120073 has 2 divisors, whose sum is σ = 210211122120074. Its totient is φ = 210211122120072.
The previous prime is 210211122120071. The next prime is 210211122120149. The reversal of 210211122120073 is 370021221112012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 206612220976144 + 3598901143929 = 14374012^2 + 1897077^2 .
It is a cyclic number.
It is not a de Polignac number, because 210211122120073 - 21 = 210211122120071 is a prime.
Together with 210211122120071, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (210211122120071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105105561060036 + 105105561060037.
It is an arithmetic number, because the mean of its divisors is an integer number (105105561060037).
Almost surely, 2210211122120073 is an apocalyptic number.
It is an amenable number.
210211122120073 is a deficient number, since it is larger than the sum of its proper divisors (1).
210211122120073 is an equidigital number, since it uses as much as digits as its factorization.
210211122120073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 25.
Adding to 210211122120073 its reverse (370021221112012), we get a palindrome (580232343232085).
The spelling of 210211122120073 in words is "two hundred ten trillion, two hundred eleven billion, one hundred twenty-two million, one hundred twenty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •