Base | Representation |
---|---|
bin | 110011011000110110… |
… | …0100011100111101101 |
3 | 101112211212012200111022 |
4 | 1212301230203213231 |
5 | 3302001442223434 |
6 | 122410243503525 |
7 | 10654465451066 |
oct | 1466154434755 |
9 | 345755180438 |
10 | 110355429869 |
11 | 4288a843903 |
12 | 19479987ba5 |
13 | a539034739 |
14 | 54ac4a556d |
15 | 2d0d40522e |
hex | 19b1b239ed |
110355429869 has 2 divisors, whose sum is σ = 110355429870. Its totient is φ = 110355429868.
The previous prime is 110355429803. The next prime is 110355429907. The reversal of 110355429869 is 968924553011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97741893769 + 12613536100 = 312637^2 + 112310^2 .
It is a cyclic number.
It is not a de Polignac number, because 110355429869 - 212 = 110355425773 is a prime.
It is a super-2 number, since 2×1103554298692 (a number of 23 digits) contains 22 as substring.
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 110355429869.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110355429469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55177714934 + 55177714935.
It is an arithmetic number, because the mean of its divisors is an integer number (55177714935).
Almost surely, 2110355429869 is an apocalyptic number.
It is an amenable number.
110355429869 is a deficient number, since it is larger than the sum of its proper divisors (1).
110355429869 is an equidigital number, since it uses as much as digits as its factorization.
110355429869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2332800, while the sum is 53.
The spelling of 110355429869 in words is "one hundred ten billion, three hundred fifty-five million, four hundred twenty-nine thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •