Base | Representation |
---|---|
bin | 100000111010010… |
… | …010101001011001 |
3 | 1102110222012122210 |
4 | 200322102221121 |
5 | 2112322323031 |
6 | 130442305333 |
7 | 16453132356 |
oct | 4072225131 |
9 | 1373865583 |
10 | 552151641 |
11 | 263747778 |
12 | 134ab8249 |
13 | 8a514962 |
14 | 5348d62d |
15 | 3371a746 |
hex | 20e92a59 |
552151641 has 8 divisors (see below), whose sum is σ = 737904160. Its totient is φ = 367250112.
The previous prime is 552151637. The next prime is 552151661. The reversal of 552151641 is 146151255.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 552151641 - 22 = 552151637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 552151599 and 552151608.
It is not an unprimeable number, because it can be changed into a prime (552151661) 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, 211231 + ... + 213828.
It is an arithmetic number, because the mean of its divisors is an integer number (92238020).
Almost surely, 2552151641 is an apocalyptic number.
It is an amenable number.
552151641 is a deficient number, since it is larger than the sum of its proper divisors (185752519).
552151641 is a wasteful number, since it uses less digits than its factorization.
552151641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425495.
The product of its digits is 6000, while the sum is 30.
The square root of 552151641 is about 23497.9071621283. The cubic root of 552151641 is about 820.3882956765.
The spelling of 552151641 in words is "five hundred fifty-two million, one hundred fifty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •