Base | Representation |
---|---|
bin | 10000000111000001101… |
… | …010001011110001001011 |
3 | 10220211111121112020012202 |
4 | 100013001222023301023 |
5 | 121114222221443021 |
6 | 2204324020430415 |
7 | 142660604546144 |
oct | 20070152136113 |
9 | 3824447466182 |
10 | 1107055656011 |
11 | 397555069868 |
12 | 15a67a84840b |
13 | 80519799b66 |
14 | 3b820590acb |
15 | 1dbe5110a0b |
hex | 101c1a8bc4b |
1107055656011 has 2 divisors, whose sum is σ = 1107055656012. Its totient is φ = 1107055656010.
The previous prime is 1107055655969. The next prime is 1107055656013. The reversal of 1107055656011 is 1106565507011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1107055656011 - 26 = 1107055655947 is a prime.
Together with 1107055656013, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1107055656013) 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, 553527828005 + 553527828006.
It is an arithmetic number, because the mean of its divisors is an integer number (553527828006).
Almost surely, 21107055656011 is an apocalyptic number.
1107055656011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1107055656011 is an equidigital number, since it uses as much as digits as its factorization.
1107055656011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31500, while the sum is 38.
The spelling of 1107055656011 in words is "one trillion, one hundred seven billion, fifty-five million, six hundred fifty-six thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •