Base | Representation |
---|---|
bin | 100000111010001… |
… | …111101101111001 |
3 | 1102110221121012100 |
4 | 200322033231321 |
5 | 2112321432031 |
6 | 130442134013 |
7 | 16453052364 |
oct | 4072175571 |
9 | 1373847170 |
10 | 552139641 |
11 | 263739759 |
12 | 134ab1309 |
13 | 8a50c361 |
14 | 534890db |
15 | 33716de6 |
hex | 20e8fb79 |
552139641 has 48 divisors (see below), whose sum is σ = 842961600. Its totient is φ = 347877504.
The previous prime is 552139619. The next prime is 552139657. The reversal of 552139641 is 146931255.
552139641 is a `hidden beast` number, since 5 + 5 + 2 + 1 + 3 + 9 + 641 = 666.
It is not a de Polignac number, because 552139641 - 29 = 552139129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 552139596 and 552139605.
It is not an unprimeable number, because it can be changed into a prime (552139681) 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 47 ways as a sum of consecutive naturals, for example, 3084490 + ... + 3084668.
It is an arithmetic number, because the mean of its divisors is an integer number (17561700).
Almost surely, 2552139641 is an apocalyptic number.
It is an amenable number.
552139641 is a deficient number, since it is larger than the sum of its proper divisors (290821959).
552139641 is a wasteful number, since it uses less digits than its factorization.
552139641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438 (or 435 counting only the distinct ones).
The product of its digits is 32400, while the sum is 36.
The square root of 552139641 is about 23497.6518188520. The cubic root of 552139641 is about 820.3823524234.
The spelling of 552139641 in words is "five hundred fifty-two million, one hundred thirty-nine thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •