Base | Representation |
---|---|
bin | 110100001010001010… |
… | …0010100110001110001 |
3 | 101201010011121200012101 |
4 | 1220110110110301301 |
5 | 3313344031201001 |
6 | 123242351300401 |
7 | 11043466322623 |
oct | 1502424246161 |
9 | 351104550171 |
10 | 112010022001 |
11 | 43559812419 |
12 | 1985bb1a701 |
13 | a740a72b37 |
14 | 55c812ac13 |
15 | 2da87d9a01 |
hex | 1a14514c71 |
112010022001 has 2 divisors, whose sum is σ = 112010022002. Its totient is φ = 112010022000.
The previous prime is 112010021969. The next prime is 112010022013. The reversal of 112010022001 is 100220010211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82383350625 + 29626671376 = 287025^2 + 172124^2 .
It is an emirp because it is prime and its reverse (100220010211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112010022001 - 25 = 112010021969 is a prime.
It is not a weakly prime, because it can be changed into another prime (112010022071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56005011000 + 56005011001.
It is an arithmetic number, because the mean of its divisors is an integer number (56005011001).
Almost surely, 2112010022001 is an apocalyptic number.
It is an amenable number.
112010022001 is a deficient number, since it is larger than the sum of its proper divisors (1).
112010022001 is an equidigital number, since it uses as much as digits as its factorization.
112010022001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 112010022001 its reverse (100220010211), we get a palindrome (212230032212).
The spelling of 112010022001 in words is "one hundred twelve billion, ten million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •