Base | Representation |
---|---|
bin | 110100101101101000… |
… | …0100011000001110011 |
3 | 101211012010011200212101 |
4 | 1221123100203001303 |
5 | 3323313223323011 |
6 | 124000425241231 |
7 | 11115130641544 |
oct | 1513320430163 |
9 | 354163150771 |
10 | 113200214131 |
11 | 4400a62a384 |
12 | 19b32633217 |
13 | a8a0512034 |
14 | 569c2264cb |
15 | 2e280392c1 |
hex | 1a5b423073 |
113200214131 has 2 divisors, whose sum is σ = 113200214132. Its totient is φ = 113200214130.
The previous prime is 113200214107. The next prime is 113200214167. The reversal of 113200214131 is 131412002311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 113200214131 - 27 = 113200214003 is a prime.
It is a super-2 number, since 2×1132002141312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113200214099 and 113200214108.
It is not a weakly prime, because it can be changed into another prime (113200215131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56600107065 + 56600107066.
It is an arithmetic number, because the mean of its divisors is an integer number (56600107066).
Almost surely, 2113200214131 is an apocalyptic number.
113200214131 is a deficient number, since it is larger than the sum of its proper divisors (1).
113200214131 is an equidigital number, since it uses as much as digits as its factorization.
113200214131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 113200214131 its reverse (131412002311), we get a palindrome (244612216442).
The spelling of 113200214131 in words is "one hundred thirteen billion, two hundred million, two hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •