Base | Representation |
---|---|
bin | 1010000011010001010100… |
… | …0011101010101110000011 |
3 | 1110010111100101102210121010 |
4 | 2200310111003222232003 |
5 | 2422031032324314210 |
6 | 35300522105132003 |
7 | 2220300422142465 |
oct | 240642503525603 |
9 | 43114311383533 |
10 | 11051304135555 |
11 | 3580917094342 |
12 | 12a599748a003 |
13 | 622197419208 |
14 | 2a2c59182135 |
15 | 14270a7a9920 |
hex | a0d150eab83 |
11051304135555 has 16 divisors (see below), whose sum is σ = 17971956890784. Its totient is φ = 5797405447680.
The previous prime is 11051304135503. The next prime is 11051304135559. The reversal of 11051304135555 is 55553140315011.
It is not a de Polignac number, because 11051304135555 - 210 = 11051304134531 is a prime.
It is a super-3 number, since 3×110513041355553 (a number of 40 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (11051304135559) 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 15 ways as a sum of consecutive naturals, for example, 6038963094 + ... + 6038964923.
It is an arithmetic number, because the mean of its divisors is an integer number (1123247305674).
Almost surely, 211051304135555 is an apocalyptic number.
11051304135555 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11051304135555 is a deficient number, since it is larger than the sum of its proper divisors (6920652755229).
11051304135555 is a wasteful number, since it uses less digits than its factorization.
11051304135555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12077928086.
The product of its (nonzero) digits is 112500, while the sum is 39.
The spelling of 11051304135555 in words is "eleven trillion, fifty-one billion, three hundred four million, one hundred thirty-five thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •