Base | Representation |
---|---|
bin | 100001000011011… |
… | …1000110110010001 |
3 | 2212021222012212201 |
4 | 1002012320312101 |
5 | 4232412230334 |
6 | 302015523201 |
7 | 36325132303 |
oct | 10206706621 |
9 | 2767865781 |
10 | 1109101969 |
11 | 51a0717a8 |
12 | 26b529501 |
13 | 148a19871 |
14 | a742b973 |
15 | 67582c14 |
hex | 421b8d91 |
1109101969 has 2 divisors, whose sum is σ = 1109101970. Its totient is φ = 1109101968.
The previous prime is 1109101963. The next prime is 1109101993. The reversal of 1109101969 is 9691019011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 817102225 + 291999744 = 28585^2 + 17088^2 .
It is a cyclic number.
It is not a de Polignac number, because 1109101969 - 27 = 1109101841 is a prime.
It is a super-2 number, since 2×11091019692 = 2460214355279353922, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1109101963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 554550984 + 554550985.
It is an arithmetic number, because the mean of its divisors is an integer number (554550985).
Almost surely, 21109101969 is an apocalyptic number.
It is an amenable number.
1109101969 is a deficient number, since it is larger than the sum of its proper divisors (1).
1109101969 is an equidigital number, since it uses as much as digits as its factorization.
1109101969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4374, while the sum is 37.
The square root of 1109101969 is about 33303.1825656348. The cubic root of 1109101969 is about 1035.1195048207.
The spelling of 1109101969 in words is "one billion, one hundred nine million, one hundred one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •