Base | Representation |
---|---|
bin | 11001000011111010011000… |
… | …110011101101110111000001 |
3 | 112110020221010022112120021001 |
4 | 121003322120303231313001 |
5 | 103421321042144201334 |
6 | 1030230213044532001 |
7 | 32134063464446263 |
oct | 3103723063556701 |
9 | 473227108476231 |
10 | 110220014443969 |
11 | 321350557a6381 |
12 | 104414639b1001 |
13 | 4966919c84791 |
14 | 1d3096a1c7b33 |
15 | cb211ed07714 |
hex | 643e98ceddc1 |
110220014443969 has 2 divisors, whose sum is σ = 110220014443970. Its totient is φ = 110220014443968.
The previous prime is 110220014443967. The next prime is 110220014444039. The reversal of 110220014443969 is 969344410022011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 56117178499600 + 54102835944369 = 7491140^2 + 7355463^2 .
It is a cyclic number.
It is not a de Polignac number, because 110220014443969 - 21 = 110220014443967 is a prime.
It is a super-2 number, since 2×1102200144439692 (a number of 29 digits) contains 22 as substring.
Together with 110220014443967, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (110220014443967) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55110007221984 + 55110007221985.
It is an arithmetic number, because the mean of its divisors is an integer number (55110007221985).
Almost surely, 2110220014443969 is an apocalyptic number.
It is an amenable number.
110220014443969 is a deficient number, since it is larger than the sum of its proper divisors (1).
110220014443969 is an equidigital number, since it uses as much as digits as its factorization.
110220014443969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 373248, while the sum is 46.
The spelling of 110220014443969 in words is "one hundred ten trillion, two hundred twenty billion, fourteen million, four hundred forty-three thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •