Base | Representation |
---|---|
bin | 111110111001010… |
… | …011111010000111 |
3 | 2201112120021120012 |
4 | 332321103322013 |
5 | 4130113224033 |
6 | 252412500435 |
7 | 35102101220 |
oct | 7671237207 |
9 | 2645507505 |
10 | 1055211143 |
11 | 4a1703828 |
12 | 25547a71b |
13 | 13a7cb4bc |
14 | a0200247 |
15 | 6298a248 |
hex | 3ee53e87 |
1055211143 has 8 divisors (see below), whose sum is σ = 1206181920. Its totient is φ = 904296960.
The previous prime is 1055211109. The next prime is 1055211167. The reversal of 1055211143 is 3411125501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1055211143 - 28 = 1055210887 is a prime.
It is a super-2 number, since 2×10552111432 = 2226941112622732898, 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 (1055211643) 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 7 ways as a sum of consecutive naturals, for example, 39263 + ... + 60431.
It is an arithmetic number, because the mean of its divisors is an integer number (150772740).
Almost surely, 21055211143 is an apocalyptic number.
1055211143 is a deficient number, since it is larger than the sum of its proper divisors (150970777).
1055211143 is an equidigital number, since it uses as much as digits as its factorization.
1055211143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28297.
The product of its (nonzero) digits is 600, while the sum is 23.
The square root of 1055211143 is about 32484.0136528724. The cubic root of 1055211143 is about 1018.0750388884.
Adding to 1055211143 its reverse (3411125501), we get a palindrome (4466336644).
The spelling of 1055211143 in words is "one billion, fifty-five million, two hundred eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •