Base | Representation |
---|---|
bin | 11001100010111110100100… |
… | …000011000010100111000001 |
3 | 112201211000101022111100012111 |
4 | 121202332210003002213001 |
5 | 104211310113222202414 |
6 | 1034543030001455321 |
7 | 32444236504300366 |
oct | 3142764403024701 |
9 | 481730338440174 |
10 | 112354801756609 |
11 | 32888449565115 |
12 | 10727143941541 |
13 | 4a90021172139 |
14 | 1da6003c7c46d |
15 | cec91608b8c4 |
hex | 662fa40c29c1 |
112354801756609 has 2 divisors, whose sum is σ = 112354801756610. Its totient is φ = 112354801756608.
The previous prime is 112354801756511. The next prime is 112354801756651. The reversal of 112354801756609 is 906657108453211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 59538245506609 + 52816556250000 = 7716103^2 + 7267500^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112354801756609 is a prime.
It is not a weakly prime, because it can be changed into another prime (112354801757609) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56177400878304 + 56177400878305.
It is an arithmetic number, because the mean of its divisors is an integer number (56177400878305).
It is a 2-persistent number, because it is pandigital, and so is 2⋅112354801756609 = 224709603513218, but 3⋅112354801756609 = 337064405269827 is not.
Almost surely, 2112354801756609 is an apocalyptic number.
It is an amenable number.
112354801756609 is a deficient number, since it is larger than the sum of its proper divisors (1).
112354801756609 is an equidigital number, since it uses as much as digits as its factorization.
112354801756609 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10886400, while the sum is 58.
The spelling of 112354801756609 in words is "one hundred twelve trillion, three hundred fifty-four billion, eight hundred one million, seven hundred fifty-six thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •