Base | Representation |
---|---|
bin | 100000111100010… |
… | …000011001110101 |
3 | 1102111221101020120 |
4 | 200330100121311 |
5 | 2112440313431 |
6 | 130501322153 |
7 | 16460406204 |
oct | 4074203165 |
9 | 1374841216 |
10 | 552666741 |
11 | 263a69780 |
12 | 135106359 |
13 | 8a665253 |
14 | 5358523b |
15 | 337bd196 |
hex | 20f10675 |
552666741 has 8 divisors (see below), whose sum is σ = 803878944. Its totient is φ = 334949520.
The previous prime is 552666731. The next prime is 552666761. The reversal of 552666741 is 147666255.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 552666741 - 26 = 552666677 is a prime.
It is a super-2 number, since 2×5526667412 = 610881053215122162, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 552666693 and 552666702.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (552666731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8373706 + ... + 8373771.
It is an arithmetic number, because the mean of its divisors is an integer number (100484868).
Almost surely, 2552666741 is an apocalyptic number.
It is an amenable number.
552666741 is a deficient number, since it is larger than the sum of its proper divisors (251212203).
552666741 is a wasteful number, since it uses less digits than its factorization.
552666741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16747491.
The product of its digits is 302400, while the sum is 42.
The square root of 552666741 is about 23508.8651576379. The cubic root of 552666741 is about 820.6433286779.
The spelling of 552666741 in words is "five hundred fifty-two million, six hundred sixty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •