Base | Representation |
---|---|
bin | 1010000011010000001011… |
… | …1011100001010101001101 |
3 | 1110010110120012011121211221 |
4 | 2200310002323201111031 |
5 | 2422024422000310221 |
6 | 35300432002443341 |
7 | 2220260040131314 |
oct | 240640273412515 |
9 | 43113505147757 |
10 | 11051000010061 |
11 | 3580780452360 |
12 | 12a5911663551 |
13 | 6221494056bb |
14 | 2a2c2aa1727b |
15 | 1426ddc33541 |
hex | a0d02ee154d |
11051000010061 has 32 divisors (see below), whose sum is σ = 12634817156352. Its totient is φ = 9567617832960.
The previous prime is 11051000010053. The next prime is 11051000010079. The reversal of 11051000010061 is 16001000015011.
It is not a de Polignac number, because 11051000010061 - 23 = 11051000010053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11051000010031) 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 31 ways as a sum of consecutive naturals, for example, 58224031 + ... + 58413523.
It is an arithmetic number, because the mean of its divisors is an integer number (394838036136).
Almost surely, 211051000010061 is an apocalyptic number.
11051000010061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11051000010061 is a deficient number, since it is larger than the sum of its proper divisors (1583817146291).
11051000010061 is a wasteful number, since it uses less digits than its factorization.
11051000010061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190533.
The product of its (nonzero) digits is 30, while the sum is 16.
Adding to 11051000010061 its reverse (16001000015011), we get a palindrome (27052000025072).
The spelling of 11051000010061 in words is "eleven trillion, fifty-one billion, ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •