Base | Representation |
---|---|
bin | 1010000010111001111010… |
… | …0001101100111100110101 |
3 | 1110002220010110202201210210 |
4 | 2200232132201230330311 |
5 | 2421430200230144023 |
6 | 35254002402140033 |
7 | 2216655622443036 |
oct | 240563641547465 |
9 | 43086113681723 |
10 | 11045020553013 |
11 | 3579192182817 |
12 | 12a4723051619 |
13 | 621705680235 |
14 | 2a2820834a8d |
15 | 14248dd07593 |
hex | a0b9e86cf35 |
11045020553013 has 16 divisors (see below), whose sum is σ = 14945457542400. Its totient is φ = 7254369670080.
The previous prime is 11045020552931. The next prime is 11045020553029. The reversal of 11045020553013 is 31035502054011.
It is not a de Polignac number, because 11045020553013 - 213 = 11045020544821 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11045020553813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50436798 + ... + 50655311.
It is an arithmetic number, because the mean of its divisors is an integer number (934091096400).
Almost surely, 211045020553013 is an apocalyptic number.
It is an amenable number.
11045020553013 is a deficient number, since it is larger than the sum of its proper divisors (3900436989387).
11045020553013 is a wasteful number, since it uses less digits than its factorization.
11045020553013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101092652.
The product of its (nonzero) digits is 9000, while the sum is 30.
The spelling of 11045020553013 in words is "eleven trillion, forty-five billion, twenty million, five hundred fifty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •