Base | Representation |
---|---|
bin | 11001000001010011111111… |
… | …111010000111110011100001 |
3 | 112102121211222021022101112012 |
4 | 121001103333322013303201 |
5 | 103410404144010044141 |
6 | 1030012144552442305 |
7 | 32115140242062125 |
oct | 3101237772076341 |
9 | 472554867271465 |
10 | 110041355549921 |
11 | 32076305487a24 |
12 | 104129033a9395 |
13 | 4952b1713b263 |
14 | 1d2605c56d585 |
15 | cac66520dceb |
hex | 6414ffe87ce1 |
110041355549921 has 2 divisors, whose sum is σ = 110041355549922. Its totient is φ = 110041355549920.
The previous prime is 110041355549893. The next prime is 110041355549927. The reversal of 110041355549921 is 129945553140011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109256428656400 + 784926893521 = 10452580^2 + 885961^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110041355549921 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 110041355549921.
It is not a weakly prime, because it can be changed into another prime (110041355549927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55020677774960 + 55020677774961.
It is an arithmetic number, because the mean of its divisors is an integer number (55020677774961).
Almost surely, 2110041355549921 is an apocalyptic number.
It is an amenable number.
110041355549921 is a deficient number, since it is larger than the sum of its proper divisors (1).
110041355549921 is an equidigital number, since it uses as much as digits as its factorization.
110041355549921 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972000, while the sum is 50.
The spelling of 110041355549921 in words is "one hundred ten trillion, forty-one billion, three hundred fifty-five million, five hundred forty-nine thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •