Base | Representation |
---|---|
bin | 10000000110100000111… |
… | …111101000100001011001 |
3 | 10220210002102022122210022 |
4 | 100012200333220201121 |
5 | 121112111423140211 |
6 | 2204153402400225 |
7 | 142641201450515 |
oct | 20064077504131 |
9 | 3823072278708 |
10 | 1106507630681 |
11 | 3972a3790272 |
12 | 15a547200075 |
13 | 8046009b40b |
14 | 3b7ab897145 |
15 | 1dbb1e5cbdb |
hex | 101a0fe8859 |
1106507630681 has 2 divisors, whose sum is σ = 1106507630682. Its totient is φ = 1106507630680.
The previous prime is 1106507630663. The next prime is 1106507630731. The reversal of 1106507630681 is 1860367056011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 823892059225 + 282615571456 = 907685^2 + 531616^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1106507630681 is a prime.
It is a super-3 number, since 3×11065076306813 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (1106507630651) 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, 553253815340 + 553253815341.
It is an arithmetic number, because the mean of its divisors is an integer number (553253815341).
Almost surely, 21106507630681 is an apocalyptic number.
It is an amenable number.
1106507630681 is a deficient number, since it is larger than the sum of its proper divisors (1).
1106507630681 is an equidigital number, since it uses as much as digits as its factorization.
1106507630681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 181440, while the sum is 44.
The spelling of 1106507630681 in words is "one trillion, one hundred six billion, five hundred seven million, six hundred thirty thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •