Base | Representation |
---|---|
bin | 111110111010111… |
… | …011010010000001 |
3 | 2201120100210101100 |
4 | 332322323102001 |
5 | 4130220301221 |
6 | 252425525013 |
7 | 35105513532 |
oct | 7672732201 |
9 | 2646323340 |
10 | 1055634561 |
11 | 4a1972963 |
12 | 255643769 |
13 | 13a919147 |
14 | a02b0689 |
15 | 62a20926 |
hex | 3eebb481 |
1055634561 has 6 divisors (see below), whose sum is σ = 1524805490. Its totient is φ = 703756368.
The previous prime is 1055634551. The next prime is 1055634581. The reversal of 1055634561 is 1654365501.
1055634561 is a `hidden beast` number, since 1 + 0 + 556 + 3 + 45 + 61 = 666.
It can be written as a sum of positive squares in only one way, i.e., 658230336 + 397404225 = 25656^2 + 19935^2 .
It is not a de Polignac number, because 1055634561 - 26 = 1055634497 is a prime.
It is a super-2 number, since 2×10556345612 = 2228728652755325442, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1055634521) 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 5 ways as a sum of consecutive naturals, for example, 58646356 + ... + 58646373.
Almost surely, 21055634561 is an apocalyptic number.
It is an amenable number.
1055634561 is a deficient number, since it is larger than the sum of its proper divisors (469170929).
1055634561 is a wasteful number, since it uses less digits than its factorization.
1055634561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117292735 (or 117292732 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The square root of 1055634561 is about 32490.5303280818. The cubic root of 1055634561 is about 1018.2111928878.
The spelling of 1055634561 in words is "one billion, fifty-five million, six hundred thirty-four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •