Base | Representation |
---|---|
bin | 111110111001010… |
… | …111000110001001 |
3 | 2201112120221110211 |
4 | 332321113012021 |
5 | 4130114133301 |
6 | 252413041121 |
7 | 35102154253 |
oct | 7671270611 |
9 | 2645527424 |
10 | 1055224201 |
11 | 4a1712619 |
12 | 2554861a1 |
13 | 13a804425 |
14 | a0204cd3 |
15 | 6298e051 |
hex | 3ee57189 |
1055224201 has 8 divisors (see below), whose sum is σ = 1084530944. Its totient is φ = 1025958960.
The previous prime is 1055224141. The next prime is 1055224207. The reversal of 1055224201 is 1024225501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1055224201 - 229 = 518353289 is a prime.
It is a super-2 number, since 2×10552242012 = 2226996228752176802, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1055224207) 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 7 ways as a sum of consecutive naturals, for example, 45256 + ... + 64486.
It is an arithmetic number, because the mean of its divisors is an integer number (135566368).
Almost surely, 21055224201 is an apocalyptic number.
It is an amenable number.
1055224201 is a deficient number, since it is larger than the sum of its proper divisors (29306743).
1055224201 is a wasteful number, since it uses less digits than its factorization.
1055224201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20751.
The product of its (nonzero) digits is 800, while the sum is 22.
The square root of 1055224201 is about 32484.2146434233. The cubic root of 1055224201 is about 1018.0792383541.
Adding to 1055224201 its reverse (1024225501), we get a palindrome (2079449702).
The spelling of 1055224201 in words is "one billion, fifty-five million, two hundred twenty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •