Base | Representation |
---|---|
bin | 111110111010111… |
… | …000110000011101 |
3 | 2201120100021012101 |
4 | 332322320300131 |
5 | 4130214433341 |
6 | 252425405101 |
7 | 35105441431 |
oct | 7672706035 |
9 | 2646307171 |
10 | 1055624221 |
11 | 4a1966113 |
12 | 255639791 |
13 | 13a914522 |
14 | a02aa9c1 |
15 | 62a1c831 |
hex | 3eeb8c1d |
1055624221 has 2 divisors, whose sum is σ = 1055624222. Its totient is φ = 1055624220.
The previous prime is 1055624177. The next prime is 1055624279. The reversal of 1055624221 is 1224265501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 983136025 + 72488196 = 31355^2 + 8514^2 .
It is a cyclic number.
It is not a de Polignac number, because 1055624221 - 229 = 518753309 is a prime.
It is a super-2 number, since 2×10556242212 = 2228684991923713682, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1055624221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1055624321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527812110 + 527812111.
It is an arithmetic number, because the mean of its divisors is an integer number (527812111).
Almost surely, 21055624221 is an apocalyptic number.
It is an amenable number.
1055624221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1055624221 is an equidigital number, since it uses as much as digits as its factorization.
1055624221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4800, while the sum is 28.
The square root of 1055624221 is about 32490.3712044045. The cubic root of 1055624221 is about 1018.2078683983.
Adding to 1055624221 its reverse (1224265501), we get a palindrome (2279889722).
The spelling of 1055624221 in words is "one billion, fifty-five million, six hundred twenty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •