Base | Representation |
---|---|
bin | 1010000011010000010111… |
… | …1100001010011100110001 |
3 | 1110010110200201012021220211 |
4 | 2200310011330022130301 |
5 | 2422030022412311004 |
6 | 35300441005104121 |
7 | 2220261222310660 |
oct | 240640574123461 |
9 | 43113621167824 |
10 | 11051050510129 |
11 | 35807a6a04853 |
12 | 12a5926558041 |
13 | 622156a075b6 |
14 | 2a2c33600dd7 |
15 | 1426e33ab504 |
hex | a0d05f0a731 |
11051050510129 has 16 divisors (see below), whose sum is σ = 12663454308480. Its totient is φ = 9447099419520.
The previous prime is 11051050510039. The next prime is 11051050510133. The reversal of 11051050510129 is 92101505015011.
It is not a de Polignac number, because 11051050510129 - 27 = 11051050510001 is a prime.
It is a super-2 number, since 2×110510505101292 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11051050510129.
It is not an unprimeable number, because it can be changed into a prime (11051050510139) 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, 2791239 + ... + 5467459.
It is an arithmetic number, because the mean of its divisors is an integer number (791465894280).
Almost surely, 211051050510129 is an apocalyptic number.
It is an amenable number.
11051050510129 is a deficient number, since it is larger than the sum of its proper divisors (1612403798351).
11051050510129 is an equidigital number, since it uses as much as digits as its factorization.
11051050510129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2677800.
The product of its (nonzero) digits is 2250, while the sum is 31.
The spelling of 11051050510129 in words is "eleven trillion, fifty-one billion, fifty million, five hundred ten thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •