Base | Representation |
---|---|
bin | 111110111001101… |
… | …110100010110011 |
3 | 2201112202211012221 |
4 | 332321232202303 |
5 | 4130130221433 |
6 | 252415101511 |
7 | 35103034255 |
oct | 7671564263 |
9 | 2645684187 |
10 | 1055320243 |
11 | 4a177879a |
12 | 255511897 |
13 | 13a839063 |
14 | a022bcd5 |
15 | 629ac72d |
hex | 3ee6e8b3 |
1055320243 has 4 divisors (see below), whose sum is σ = 1055487888. Its totient is φ = 1055152600.
The previous prime is 1055320229. The next prime is 1055320289. The reversal of 1055320243 is 3420235501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1055320243 - 29 = 1055319731 is a prime.
It is a super-2 number, since 2×10553202432 = 2227401630571158098, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1055320223) 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 3 ways as a sum of consecutive naturals, for example, 73996 + ... + 87097.
It is an arithmetic number, because the mean of its divisors is an integer number (263871972).
Almost surely, 21055320243 is an apocalyptic number.
1055320243 is a deficient number, since it is larger than the sum of its proper divisors (167645).
1055320243 is an equidigital number, since it uses as much as digits as its factorization.
1055320243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167644.
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 1055320243 is about 32485.6928970278. The cubic root of 1055320243 is about 1018.1101244918.
Adding to 1055320243 its reverse (3420235501), we get a palindrome (4475555744).
The spelling of 1055320243 in words is "one billion, fifty-five million, three hundred twenty thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •