Base | Representation |
---|---|
bin | 101111110001100010000011… |
… | …101110110111101000110011 |
3 | 1000112221111211020212011010101 |
4 | 233301202003232313220303 |
5 | 210014433344104102011 |
6 | 2022512042554213231 |
7 | 62154043325110363 |
oct | 5761420356675063 |
9 | 1015844736764111 |
10 | 210112010222131 |
11 | 60a48004186086 |
12 | 1b695147124217 |
13 | 903162922a344 |
14 | 39c5692cd29a3 |
15 | 194576780b2c1 |
hex | bf1883bb7a33 |
210112010222131 has 2 divisors, whose sum is σ = 210112010222132. Its totient is φ = 210112010222130.
The previous prime is 210112010222099. The next prime is 210112010222189. The reversal of 210112010222131 is 131222010211012.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 210112010222131 - 25 = 210112010222099 is a prime.
It is a super-2 number, since 2×2101120102221312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210112010222099 and 210112010222108.
It is not a weakly prime, because it can be changed into another prime (210112010222531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105056005111065 + 105056005111066.
It is an arithmetic number, because the mean of its divisors is an integer number (105056005111066).
Almost surely, 2210112010222131 is an apocalyptic number.
210112010222131 is a deficient number, since it is larger than the sum of its proper divisors (1).
210112010222131 is an equidigital number, since it uses as much as digits as its factorization.
210112010222131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 210112010222131 its reverse (131222010211012), we get a palindrome (341334020433143).
The spelling of 210112010222131 in words is "two hundred ten trillion, one hundred twelve billion, ten million, two hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •