Base | Representation |
---|---|
bin | 111110111010100… |
… | …100010001010111 |
3 | 2201120012000002121 |
4 | 332322210101113 |
5 | 4130204242221 |
6 | 252423520411 |
7 | 35104642000 |
oct | 7672442127 |
9 | 2646160077 |
10 | 1055540311 |
11 | 4a1909071 |
12 | 2555b9107 |
13 | 13a8b5287 |
14 | a02881a7 |
15 | 62a02a41 |
hex | 3eea4457 |
1055540311 has 32 divisors (see below), whose sum is σ = 1304294400. Its totient is φ = 852068448.
The previous prime is 1055540303. The next prime is 1055540351. The reversal of 1055540311 is 1130455501.
It is a happy number.
It is not a de Polignac number, because 1055540311 - 23 = 1055540303 is a prime.
It is a super-2 number, since 2×10555403112 = 2228330696291953442, 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 (1055540351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 527565 + ... + 529561.
It is an arithmetic number, because the mean of its divisors is an integer number (40759200).
Almost surely, 21055540311 is an apocalyptic number.
1055540311 is a deficient number, since it is larger than the sum of its proper divisors (248754089).
1055540311 is an equidigital number, since it uses as much as digits as its factorization.
1055540311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2108 (or 2094 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
The square root of 1055540311 is about 32489.0798730897. The cubic root of 1055540311 is about 1018.1808890735.
Adding to 1055540311 its reverse (1130455501), we get a palindrome (2185995812).
The spelling of 1055540311 in words is "one billion, fifty-five million, five hundred forty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •