Base | Representation |
---|---|
bin | 11001011101111101100010… |
… | …010010110001100001101001 |
3 | 112200121001122112120210212202 |
4 | 121131331202102301201221 |
5 | 104140133141401413001 |
6 | 1034120421412345545 |
7 | 32410314504023333 |
oct | 3135754222614151 |
9 | 480531575523782 |
10 | 112010101201001 |
11 | 32765243037883 |
12 | 106903843152b5 |
13 | 4a66679497333 |
14 | 1d93464178453 |
15 | ce398e3dd96b |
hex | 65df624b1869 |
112010101201001 has 2 divisors, whose sum is σ = 112010101201002. Its totient is φ = 112010101201000.
The previous prime is 112010101200979. The next prime is 112010101201003. The reversal of 112010101201001 is 100102101010211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111990914795776 + 19186405225 = 10582576^2 + 138515^2 .
It is a cyclic number.
It is not a de Polignac number, because 112010101201001 - 222 = 112010097006697 is a prime.
Together with 112010101201003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (112010101201003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56005050600500 + 56005050600501.
It is an arithmetic number, because the mean of its divisors is an integer number (56005050600501).
Almost surely, 2112010101201001 is an apocalyptic number.
It is an amenable number.
112010101201001 is a deficient number, since it is larger than the sum of its proper divisors (1).
112010101201001 is an equidigital number, since it uses as much as digits as its factorization.
112010101201001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 112010101201001 its reverse (100102101010211), we get a palindrome (212112202211212).
The spelling of 112010101201001 in words is "one hundred twelve trillion, ten billion, one hundred one million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •