Base | Representation |
---|---|
bin | 1101010111011… |
… | …11101110111001 |
3 | 21210222211211001 |
4 | 12223233232321 |
5 | 212201143001 |
6 | 15043205001 |
7 | 2531045353 |
oct | 653575671 |
9 | 253884731 |
10 | 112131001 |
11 | 58327754 |
12 | 31676761 |
13 | 1a300308 |
14 | 10c6c0d3 |
15 | 9c9e001 |
hex | 6aefbb9 |
112131001 has 2 divisors, whose sum is σ = 112131002. Its totient is φ = 112131000.
The previous prime is 112130983. The next prime is 112131013. The reversal of 112131001 is 100131211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106584976 + 5546025 = 10324^2 + 2355^2 .
It is an emirp because it is prime and its reverse (100131211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112131001 - 25 = 112130969 is a prime.
It is a super-2 number, since 2×1121310012 = 25146722770524002, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112132001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56065500 + 56065501.
It is an arithmetic number, because the mean of its divisors is an integer number (56065501).
Almost surely, 2112131001 is an apocalyptic number.
It is an amenable number.
112131001 is a deficient number, since it is larger than the sum of its proper divisors (1).
112131001 is an equidigital number, since it uses as much as digits as its factorization.
112131001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 10.
The square root of 112131001 is about 10589.1926510004. The cubic root of 112131001 is about 482.2163147566.
Adding to 112131001 its reverse (100131211), we get a palindrome (212262212).
The spelling of 112131001 in words is "one hundred twelve million, one hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •