Base | Representation |
---|---|
bin | 1010000011010010101010… |
… | …0000101001110011100011 |
3 | 1110010112021110200121222022 |
4 | 2200310222200221303203 |
5 | 2422032301444234043 |
6 | 35301021523332055 |
7 | 2220312352334030 |
oct | 240645240516343 |
9 | 43115243617868 |
10 | 11051664055523 |
11 | 3580a91274563 |
12 | 12a5a77b2102b |
13 | 622223b66700 |
14 | 2a2c90cb2387 |
15 | 14272c1a2868 |
hex | a0d2a829ce3 |
11051664055523 has 48 divisors (see below), whose sum is σ = 14492466547776. Its totient is φ = 8223465369600.
The previous prime is 11051664055517. The next prime is 11051664055567. The reversal of 11051664055523 is 32555046615011.
It is not a de Polignac number, because 11051664055523 - 26 = 11051664055459 is a prime.
It is a super-2 number, since 2×110516640555232 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11051664055723) 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 in 47 ways as a sum of consecutive naturals, for example, 25953215 + ... + 26375607.
It is an arithmetic number, because the mean of its divisors is an integer number (301926386412).
Almost surely, 211051664055523 is an apocalyptic number.
11051664055523 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11051664055523 is a deficient number, since it is larger than the sum of its proper divisors (3440802492253).
11051664055523 is a wasteful number, since it uses less digits than its factorization.
11051664055523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423744 (or 423731 counting only the distinct ones).
The product of its (nonzero) digits is 540000, while the sum is 44.
The spelling of 11051664055523 in words is "eleven trillion, fifty-one billion, six hundred sixty-four million, fifty-five thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •