Base | Representation |
---|---|
bin | 101111110001101010011100… |
… | …110100101011111101000011 |
3 | 1000112222101002020102210102001 |
4 | 233301222130310223331003 |
5 | 210020110322401042011 |
6 | 2022520133045004431 |
7 | 62154512532315613 |
oct | 5761523464537503 |
9 | 1015871066383361 |
10 | 210121021112131 |
11 | 60a50908635108 |
12 | 1b696a409b3717 |
13 | 903243402130c |
14 | 39c5ca9940a43 |
15 | 1945ae39397c1 |
hex | bf1a9cd2bf43 |
210121021112131 has 2 divisors, whose sum is σ = 210121021112132. Its totient is φ = 210121021112130.
The previous prime is 210121021112117. The next prime is 210121021112209. The reversal of 210121021112131 is 131211120121012.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210121021112131 is a prime.
It is a super-2 number, since 2×2101210211121312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210121021112099 and 210121021112108.
It is not a weakly prime, because it can be changed into another prime (210121021116131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105060510556065 + 105060510556066.
It is an arithmetic number, because the mean of its divisors is an integer number (105060510556066).
Almost surely, 2210121021112131 is an apocalyptic number.
210121021112131 is a deficient number, since it is larger than the sum of its proper divisors (1).
210121021112131 is an equidigital number, since it uses as much as digits as its factorization.
210121021112131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 210121021112131 its reverse (131211120121012), we get a palindrome (341332141233143).
The spelling of 210121021112131 in words is "two hundred ten trillion, one hundred twenty-one billion, twenty-one million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •