Base | Representation |
---|---|
bin | 11001011101111011011100… |
… | …010101011000101000111001 |
3 | 112200120211211220120212222211 |
4 | 121131323130111120220321 |
5 | 104140114041024113203 |
6 | 1034115410405415121 |
7 | 32410205013635563 |
oct | 3135733425305071 |
9 | 480524756525884 |
10 | 112007853738553 |
11 | 3276429a43aaa3 |
12 | 1068ba5770a4a1 |
13 | 4a663ab9885b6 |
14 | 1d932cd8a4333 |
15 | ce38abe48c6d |
hex | 65dedc558a39 |
112007853738553 has 2 divisors, whose sum is σ = 112007853738554. Its totient is φ = 112007853738552.
The previous prime is 112007853738551. The next prime is 112007853738569. The reversal of 112007853738553 is 355837358700211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110803244321344 + 1204609417209 = 10526312^2 + 1097547^2 .
It is an emirp because it is prime and its reverse (355837358700211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112007853738553 - 21 = 112007853738551 is a prime.
Together with 112007853738551, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (112007853738551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56003926869276 + 56003926869277.
It is an arithmetic number, because the mean of its divisors is an integer number (56003926869277).
Almost surely, 2112007853738553 is an apocalyptic number.
It is an amenable number.
112007853738553 is a deficient number, since it is larger than the sum of its proper divisors (1).
112007853738553 is an equidigital number, since it uses as much as digits as its factorization.
112007853738553 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21168000, while the sum is 58.
The spelling of 112007853738553 in words is "one hundred twelve trillion, seven billion, eight hundred fifty-three million, seven hundred thirty-eight thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •