Base | Representation |
---|---|
bin | 111110101001011… |
… | …101010011001111 |
3 | 2201020202010211111 |
4 | 332221131103033 |
5 | 4123032232221 |
6 | 252143432451 |
7 | 35021552125 |
oct | 7651352317 |
9 | 2636663744 |
10 | 1051055311 |
11 | 49a325459 |
12 | 253bb5727 |
13 | 1399a4a27 |
14 | 9d83b915 |
15 | 62418be1 |
hex | 3ea5d4cf |
1051055311 has 32 divisors (see below), whose sum is σ = 1188794880. Its totient is φ = 924109824.
The previous prime is 1051055309. The next prime is 1051055347. The reversal of 1051055311 is 1135501501.
It is not a de Polignac number, because 1051055311 - 21 = 1051055309 is a prime.
It is a super-2 number, since 2×10510553112 = 2209434533562613442, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1051055611) 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, 4510851 + ... + 4511083.
It is an arithmetic number, because the mean of its divisors is an integer number (37149840).
Almost surely, 21051055311 is an apocalyptic number.
1051055311 is a deficient number, since it is larger than the sum of its proper divisors (137739569).
1051055311 is a wasteful number, since it uses less digits than its factorization.
1051055311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 495.
The product of its (nonzero) digits is 375, while the sum is 22.
The square root of 1051055311 is about 32419.9832048075. The cubic root of 1051055311 is about 1016.7367552624.
Adding to 1051055311 its reverse (1135501501), we get a palindrome (2186556812).
It can be divided in two parts, 10510553 and 11, that added together give a square (10510564 = 32422).
The spelling of 1051055311 in words is "one billion, fifty-one million, fifty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •