Base | Representation |
---|---|
bin | 1010000011010000010101… |
… | …1101010001010000000001 |
3 | 1110010110200010221211201101 |
4 | 2200310011131101100001 |
5 | 2422030013324132041 |
6 | 35300440115334401 |
7 | 2220261063420610 |
oct | 240640535212001 |
9 | 43113603854641 |
10 | 11051042411521 |
11 | 35807a2383192 |
12 | 12a59238b1401 |
13 | 622155130318 |
14 | 2a2c324d3877 |
15 | 1426e280bb31 |
hex | a0d05751401 |
11051042411521 has 16 divisors (see below), whose sum is σ = 12973023181440. Its totient is φ = 9214952359680.
The previous prime is 11051042411467. The next prime is 11051042411531. The reversal of 11051042411521 is 12511424015011.
It is a cyclic number.
It is not a de Polignac number, because 11051042411521 - 27 = 11051042411393 is a prime.
It is a super-2 number, since 2×110510424115212 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11051042411521.
It is not an unprimeable number, because it can be changed into a prime (11051042411531) 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, 1391320 + ... + 4902841.
It is an arithmetic number, because the mean of its divisors is an integer number (810813948840).
Almost surely, 211051042411521 is an apocalyptic number.
It is an amenable number.
11051042411521 is a deficient number, since it is larger than the sum of its proper divisors (1921980769919).
11051042411521 is an equidigital number, since it uses as much as digits as its factorization.
11051042411521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6300984.
The product of its (nonzero) digits is 1600, while the sum is 28.
Adding to 11051042411521 its reverse (12511424015011), we get a palindrome (23562466426532).
The spelling of 11051042411521 in words is "eleven trillion, fifty-one billion, forty-two million, four hundred eleven thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •