Base | Representation |
---|---|
bin | 1010000011010000011001… |
… | …0001010101011001010111 |
3 | 1110010110201002122020220021 |
4 | 2200310012101111121113 |
5 | 2422030030322404431 |
6 | 35300441324050011 |
7 | 2220261320424223 |
oct | 240640621253127 |
9 | 43113632566807 |
10 | 11051056059991 |
11 | 35807aa055512 |
12 | 12a5928393907 |
13 | 622157bcb73c |
14 | 2a2c34247783 |
15 | 1426e3b05b11 |
hex | a0d06455657 |
11051056059991 has 2 divisors, whose sum is σ = 11051056059992. Its totient is φ = 11051056059990.
The previous prime is 11051056059937. The next prime is 11051056060001. The reversal of 11051056059991 is 19995065015011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11051056059991 - 27 = 11051056059863 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11051056059191) 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, 5525528029995 + 5525528029996.
It is an arithmetic number, because the mean of its divisors is an integer number (5525528029996).
Almost surely, 211051056059991 is an apocalyptic number.
11051056059991 is a deficient number, since it is larger than the sum of its proper divisors (1).
11051056059991 is an equidigital number, since it uses as much as digits as its factorization.
11051056059991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 546750, while the sum is 52.
The spelling of 11051056059991 in words is "eleven trillion, fifty-one billion, fifty-six million, fifty-nine thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •