Base | Representation |
---|---|
bin | 1100001110101110101… |
… | …0001000110100000001 |
3 | 202002100002000201020122 |
4 | 3003223222020310001 |
5 | 11420302200401423 |
6 | 240305115550025 |
7 | 21115526366405 |
oct | 3035352106401 |
9 | 662302021218 |
10 | 210112122113 |
11 | 811208a7213 |
12 | 3487a15b315 |
13 | 16a7630589a |
14 | a2530ad105 |
15 | 56eb0cd8c8 |
hex | 30eba88d01 |
210112122113 has 2 divisors, whose sum is σ = 210112122114. Its totient is φ = 210112122112.
The previous prime is 210112122107. The next prime is 210112122119. The reversal of 210112122113 is 311221211012.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (210112122107) and next prime (210112122119).
It can be written as a sum of positive squares in only one way, i.e., 203989529104 + 6122593009 = 451652^2 + 78247^2 .
It is a cyclic number.
It is not a de Polignac number, because 210112122113 - 26 = 210112122049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210112122091 and 210112122100.
It is not a weakly prime, because it can be changed into another prime (210112122119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105056061056 + 105056061057.
It is an arithmetic number, because the mean of its divisors is an integer number (105056061057).
Almost surely, 2210112122113 is an apocalyptic number.
It is an amenable number.
210112122113 is a deficient number, since it is larger than the sum of its proper divisors (1).
210112122113 is an equidigital number, since it uses as much as digits as its factorization.
210112122113 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 17.
Adding to 210112122113 its reverse (311221211012), we get a palindrome (521333333125).
The spelling of 210112122113 in words is "two hundred ten billion, one hundred twelve million, one hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •