Base | Representation |
---|---|
bin | 1010000011010001010100… |
… | …1000110000010101011111 |
3 | 1110010111100110221120010022 |
4 | 2200310111020300111133 |
5 | 2422031033200004104 |
6 | 35300522153502355 |
7 | 2220300436366055 |
oct | 240642510602537 |
9 | 43114313846108 |
10 | 11051305469279 |
11 | 3580917915399 |
12 | 12a5997a119bb |
13 | 6221977952ba |
14 | 2a2c5940c1d5 |
15 | 14270a96ebbe |
hex | a0d1523055f |
11051305469279 has 2 divisors, whose sum is σ = 11051305469280. Its totient is φ = 11051305469278.
The previous prime is 11051305469273. The next prime is 11051305469299. The reversal of 11051305469279 is 97296450315011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11051305469279 - 220 = 11051304420703 is a prime.
It is a super-4 number, since 4×110513054692794 (a number of 53 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11051305469279.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11051305469273) 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 as a sum of consecutive naturals, namely, 5525652734639 + 5525652734640.
It is an arithmetic number, because the mean of its divisors is an integer number (5525652734640).
Almost surely, 211051305469279 is an apocalyptic number.
11051305469279 is a deficient number, since it is larger than the sum of its proper divisors (1).
11051305469279 is an equidigital number, since it uses as much as digits as its factorization.
11051305469279 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2041200, while the sum is 53.
The spelling of 11051305469279 in words is "eleven trillion, fifty-one billion, three hundred five million, four hundred sixty-nine thousand, two hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •