Base | Representation |
---|---|
bin | 110011100010011000… |
… | …1010011110110110001 |
3 | 101120200011101001010222 |
4 | 1213010301103312301 |
5 | 3303130403134441 |
6 | 122502114502425 |
7 | 10665432513245 |
oct | 1470461236661 |
9 | 346604331128 |
10 | 110675443121 |
11 | 42a34447571 |
12 | 19548b94a15 |
13 | a58a41b9a9 |
14 | 54dcba8425 |
15 | 2d2b568d4b |
hex | 19c4c53db1 |
110675443121 has 2 divisors, whose sum is σ = 110675443122. Its totient is φ = 110675443120.
The previous prime is 110675443103. The next prime is 110675443127. The reversal of 110675443121 is 121344576011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102938305600 + 7737137521 = 320840^2 + 87961^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110675443121 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (110675443127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55337721560 + 55337721561.
It is an arithmetic number, because the mean of its divisors is an integer number (55337721561).
Almost surely, 2110675443121 is an apocalyptic number.
It is an amenable number.
110675443121 is a deficient number, since it is larger than the sum of its proper divisors (1).
110675443121 is an equidigital number, since it uses as much as digits as its factorization.
110675443121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 35.
The spelling of 110675443121 in words is "one hundred ten billion, six hundred seventy-five million, four hundred forty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •