Base | Representation |
---|---|
bin | 101111110001101010011100… |
… | …111000100010100000101111 |
3 | 1000112222101002022100002201202 |
4 | 233301222130320202200233 |
5 | 210020110323130401111 |
6 | 2022520133122400115 |
7 | 62154512544023126 |
oct | 5761523470424057 |
9 | 1015871068302652 |
10 | 210121022122031 |
11 | 60a50909164939 |
12 | 1b696a4120003b |
13 | 90324342b5ba7 |
14 | 39c5ca9b24abd |
15 | 1945ae3a88b3b |
hex | bf1a9ce2282f |
210121022122031 has 2 divisors, whose sum is σ = 210121022122032. Its totient is φ = 210121022122030.
The previous prime is 210121022122027. The next prime is 210121022122049. The reversal of 210121022122031 is 130221220121012.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 210121022122031 - 22 = 210121022122027 is a prime.
It is a super-2 number, since 2×2101210221220312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210121022121994 and 210121022122012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210121022122021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105060511061015 + 105060511061016.
It is an arithmetic number, because the mean of its divisors is an integer number (105060511061016).
Almost surely, 2210121022122031 is an apocalyptic number.
210121022122031 is a deficient number, since it is larger than the sum of its proper divisors (1).
210121022122031 is an equidigital number, since it uses as much as digits as its factorization.
210121022122031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 210121022122031 its reverse (130221220121012), we get a palindrome (340342242243043).
The spelling of 210121022122031 in words is "two hundred ten trillion, one hundred twenty-one billion, twenty-two million, one hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •