Base | Representation |
---|---|
bin | 1010000001000010101100… |
… | …1001110001111110011101 |
3 | 1102222211112022022212121222 |
4 | 2200100223021301332131 |
5 | 2420414131123144404 |
6 | 35231151150103125 |
7 | 2214443622364514 |
oct | 240205311617635 |
9 | 42884468285558 |
10 | 11013020131229 |
11 | 3566660834246 |
12 | 129a4921aaaa5 |
13 | 61b6a5a23b0c |
14 | 2a106686167b |
15 | 141719785dbe |
hex | a042b271f9d |
11013020131229 has 2 divisors, whose sum is σ = 11013020131230. Its totient is φ = 11013020131228.
The previous prime is 11013020131199. The next prime is 11013020131279. The reversal of 11013020131229 is 92213102031011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8876365538329 + 2136654592900 = 2979323^2 + 1461730^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11013020131229 is a prime.
It is a super-2 number, since 2×110130201312292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11013020131198 and 11013020131207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11013020131279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506510065614 + 5506510065615.
It is an arithmetic number, because the mean of its divisors is an integer number (5506510065615).
Almost surely, 211013020131229 is an apocalyptic number.
It is an amenable number.
11013020131229 is a deficient number, since it is larger than the sum of its proper divisors (1).
11013020131229 is an equidigital number, since it uses as much as digits as its factorization.
11013020131229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 26.
The spelling of 11013020131229 in words is "eleven trillion, thirteen billion, twenty million, one hundred thirty-one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •