Base | Representation |
---|---|
bin | 100000111010001… |
… | …000100001000111 |
3 | 1102110220002202010 |
4 | 200322020201013 |
5 | 2112320011101 |
6 | 130441345303 |
7 | 16452600405 |
oct | 4072104107 |
9 | 1373802663 |
10 | 552110151 |
11 | 26371958a |
12 | 134a98233 |
13 | 8a4cbac8 |
14 | 5347c475 |
15 | 3370d2d6 |
hex | 20e88847 |
552110151 has 12 divisors (see below), whose sum is σ = 776932152. Its totient is φ = 348700464.
The previous prime is 552110131. The next prime is 552110159. The reversal of 552110151 is 151011255.
It is not a de Polignac number, because 552110151 - 26 = 552110087 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (552110159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 253816 + ... + 255981.
It is an arithmetic number, because the mean of its divisors is an integer number (64744346).
Almost surely, 2552110151 is an apocalyptic number.
552110151 is a deficient number, since it is larger than the sum of its proper divisors (224822001).
552110151 is a wasteful number, since it uses less digits than its factorization.
552110151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 509838 (or 509819 counting only the distinct ones).
The product of its (nonzero) digits is 250, while the sum is 21.
The square root of 552110151 is about 23497.0243009620. The cubic root of 552110151 is about 820.3677465130.
The spelling of 552110151 in words is "five hundred fifty-two million, one hundred ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •