Base | Representation |
---|---|
bin | 11001011101111101011100… |
… | …111110100010111011100001 |
3 | 112200121001102022202112220221 |
4 | 121131331130332202323201 |
5 | 104140133001033343012 |
6 | 1034120404505003041 |
7 | 32410312341650002 |
oct | 3135753476427341 |
9 | 480531368675827 |
10 | 112010012012257 |
11 | 327651a775aa77 |
12 | 1069035a483481 |
13 | 4a66663b6a728 |
14 | 1d9345639d1a9 |
15 | ce3986672507 |
hex | 65df5cfa2ee1 |
112010012012257 has 2 divisors, whose sum is σ = 112010012012258. Its totient is φ = 112010012012256.
The previous prime is 112010012012209. The next prime is 112010012012273. The reversal of 112010012012257 is 752210210010211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91974218521761 + 20035793490496 = 9590319^2 + 4476136^2 .
It is a cyclic number.
It is not a de Polignac number, because 112010012012257 - 223 = 112010003623649 is a prime.
It is not a weakly prime, because it can be changed into another prime (112010012012287) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56005006006128 + 56005006006129.
It is an arithmetic number, because the mean of its divisors is an integer number (56005006006129).
Almost surely, 2112010012012257 is an apocalyptic number.
It is an amenable number.
112010012012257 is a deficient number, since it is larger than the sum of its proper divisors (1).
112010012012257 is an equidigital number, since it uses as much as digits as its factorization.
112010012012257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 25.
Adding to 112010012012257 its reverse (752210210010211), we get a palindrome (864220222022468).
The spelling of 112010012012257 in words is "one hundred twelve trillion, ten billion, twelve million, twelve thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •