Base | Representation |
---|---|
bin | 10000001001010111000… |
… | …100100011011101001001 |
3 | 10221001222022100200210022 |
4 | 100021113010203131021 |
5 | 121134340431431321 |
6 | 2205420444230225 |
7 | 143106663364556 |
oct | 20112704433511 |
9 | 3831868320708 |
10 | 1109562373961 |
11 | 398621041098 |
12 | 15b05a23b375 |
13 | 80828c0c012 |
14 | 3b9bb46da2d |
15 | 1dce0216dab |
hex | 10257123749 |
1109562373961 has 2 divisors, whose sum is σ = 1109562373962. Its totient is φ = 1109562373960.
The previous prime is 1109562373883. The next prime is 1109562374059. The reversal of 1109562373961 is 1693732659011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1022840958736 + 86721415225 = 1011356^2 + 294485^2 .
It is a cyclic number.
It is not a de Polignac number, because 1109562373961 - 214 = 1109562357577 is a prime.
It is a super-2 number, since 2×11095623739612 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1109567373961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 554781186980 + 554781186981.
It is an arithmetic number, because the mean of its divisors is an integer number (554781186981).
Almost surely, 21109562373961 is an apocalyptic number.
It is an amenable number.
1109562373961 is a deficient number, since it is larger than the sum of its proper divisors (1).
1109562373961 is an equidigital number, since it uses as much as digits as its factorization.
1109562373961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1837080, while the sum is 53.
The spelling of 1109562373961 in words is "one trillion, one hundred nine billion, five hundred sixty-two million, three hundred seventy-three thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •