Base | Representation |
---|---|
bin | 1010000100000000110100… |
… | …0110010010001011100001 |
3 | 1110011201021001101111220222 |
4 | 2201000031012102023201 |
5 | 2422233141202140013 |
6 | 35310431255212425 |
7 | 2221231416042524 |
oct | 241001506221341 |
9 | 43151231344828 |
10 | 11064055505633 |
11 | 358626a991419 |
12 | 12a8355977115 |
13 | 62344a138000 |
14 | 2a37088aabbb |
15 | 142c04e98508 |
hex | a100d1922e1 |
11064055505633 has 16 divisors (see below), whose sum is σ = 12690678183120. Its totient is φ = 9612211085568.
The previous prime is 11064055505617. The next prime is 11064055505669. The reversal of 11064055505633 is 33650555046011.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 8540936110144 + 2523119395489 = 2922488^2 + 1588433^2 .
It is not a de Polignac number, because 11064055505633 - 24 = 11064055505617 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11064055505693) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 148079810 + ... + 148154507.
It is an arithmetic number, because the mean of its divisors is an integer number (793167386445).
Almost surely, 211064055505633 is an apocalyptic number.
11064055505633 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11064055505633 is a deficient number, since it is larger than the sum of its proper divisors (1626622677487).
11064055505633 is an equidigital number, since it uses as much as digits as its factorization.
11064055505633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296234373 (or 296234347 counting only the distinct ones).
The product of its (nonzero) digits is 810000, while the sum is 44.
The spelling of 11064055505633 in words is "eleven trillion, sixty-four billion, fifty-five million, five hundred five thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •