Base | Representation |
---|---|
bin | 10000001001100011101… |
… | …010100010110100111011 |
3 | 10221002112000221002222211 |
4 | 100021203222202310323 |
5 | 121140304024100301 |
6 | 2205453432555551 |
7 | 143115140314342 |
oct | 20114352426473 |
9 | 3832460832884 |
10 | 1109773659451 |
11 | 39871a331aa6 |
12 | 15b0b8b52bb7 |
13 | 80860918012 |
14 | 3b9db54cb59 |
15 | 1dd03a50051 |
hex | 10263aa2d3b |
1109773659451 has 2 divisors, whose sum is σ = 1109773659452. Its totient is φ = 1109773659450.
The previous prime is 1109773659413. The next prime is 1109773659457. The reversal of 1109773659451 is 1549563779011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1109773659451 is a prime.
It is a super-2 number, since 2×11097736594512 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1109773659457) 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, 554886829725 + 554886829726.
It is an arithmetic number, because the mean of its divisors is an integer number (554886829726).
Almost surely, 21109773659451 is an apocalyptic number.
1109773659451 is a deficient number, since it is larger than the sum of its proper divisors (1).
1109773659451 is an equidigital number, since it uses as much as digits as its factorization.
1109773659451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7144200, while the sum is 58.
The spelling of 1109773659451 in words is "one trillion, one hundred nine billion, seven hundred seventy-three million, six hundred fifty-nine thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •