Base | Representation |
---|---|
bin | 111110110001101… |
… | …010010000101111 |
3 | 2201101210101102000 |
4 | 332301222100233 |
5 | 4124110034201 |
6 | 252301503343 |
7 | 35046046056 |
oct | 7661522057 |
9 | 2641711360 |
10 | 1053205551 |
11 | 4a0563a12 |
12 | 254871b53 |
13 | 13a278668 |
14 | 9dc3b39d |
15 | 626e0d86 |
hex | 3ec6a42f |
1053205551 has 16 divisors (see below), whose sum is σ = 1582283520. Its totient is φ = 692246520.
The previous prime is 1053205541. The next prime is 1053205567. The reversal of 1053205551 is 1555023501.
1053205551 is a `hidden beast` number, since 105 + 3 + 2 + 0 + 5 + 551 = 666.
It is not a de Polignac number, because 1053205551 - 214 = 1053189167 is a prime.
It is a super-2 number, since 2×10532055512 = 2218483865314427202, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053205541) 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 15 ways as a sum of consecutive naturals, for example, 272785 + ... + 276618.
It is an arithmetic number, because the mean of its divisors is an integer number (98892720).
Almost surely, 21053205551 is an apocalyptic number.
1053205551 is a deficient number, since it is larger than the sum of its proper divisors (529077969).
1053205551 is an equidigital number, since it uses as much as digits as its factorization.
1053205551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 549483 (or 549477 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The square root of 1053205551 is about 32453.1285240730. The cubic root of 1053205551 is about 1017.4296267838.
The spelling of 1053205551 in words is "one billion, fifty-three million, two hundred five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •