Base | Representation |
---|---|
bin | 1010000011010000011001… |
… | …0001100000101000010001 |
3 | 1110010110201002201121000100 |
4 | 2200310012101200220101 |
5 | 2422030030330343001 |
6 | 35300441325043013 |
7 | 2220261321005322 |
oct | 240640621405021 |
9 | 43113632647010 |
10 | 11051056106001 |
11 | 35807aa08703a |
12 | 12a59283b6469 |
13 | 622157c16672 |
14 | 2a2c3425a449 |
15 | 1426e3b14586 |
hex | a0d06460a11 |
11051056106001 has 6 divisors (see below), whose sum is σ = 15962636597570. Its totient is φ = 7367370737328.
The previous prime is 11051056105981. The next prime is 11051056106021. The reversal of 11051056106001 is 10060165015011.
11051056106001 is a `hidden beast` number, since 1 + 1 + 0 + 5 + 1 + 0 + 56 + 1 + 0 + 600 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (11051056105981) and next prime (11051056106021).
It can be written as a sum of positive squares in only one way, i.e., 11049674051025 + 1382054976 = 3324105^2 + 37176^2 .
It is not a de Polignac number, because 11051056106001 - 242 = 6653009594897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11051056106021) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 613947561436 + ... + 613947561453.
Almost surely, 211051056106001 is an apocalyptic number.
It is an amenable number.
11051056106001 is a deficient number, since it is larger than the sum of its proper divisors (4911580491569).
11051056106001 is a wasteful number, since it uses less digits than its factorization.
11051056106001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1227895122895 (or 1227895122892 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
The spelling of 11051056106001 in words is "eleven trillion, fifty-one billion, fifty-six million, one hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •