Base | Representation |
---|---|
bin | 100000111011000… |
… | …001111110101010 |
3 | 1102111100001121021 |
4 | 200323001332222 |
5 | 2112400024024 |
6 | 130450403054 |
7 | 16454600530 |
oct | 4073017652 |
9 | 1374301537 |
10 | 552345514 |
11 | 26386a3a6 |
12 | 134b9048a |
13 | 8a581c86 |
14 | 53500150 |
15 | 33757de4 |
hex | 20ec1faa |
552345514 has 8 divisors (see below), whose sum is σ = 946878048. Its totient is φ = 236719500.
The previous prime is 552345511. The next prime is 552345517. The reversal of 552345514 is 415543255.
552345514 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (552345511) and next prime (552345517).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 552345514.
It is not an unprimeable number, because it can be changed into a prime (552345511) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19726612 + ... + 19726639.
It is an arithmetic number, because the mean of its divisors is an integer number (118359756).
Almost surely, 2552345514 is an apocalyptic number.
552345514 is a deficient number, since it is larger than the sum of its proper divisors (394532534).
552345514 is a wasteful number, since it uses less digits than its factorization.
552345514 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39453260.
The product of its digits is 60000, while the sum is 34.
The square root of 552345514 is about 23502.0321249036. The cubic root of 552345514 is about 820.4843034374.
Adding to 552345514 its reverse (415543255), we get a palindrome (967888769).
The spelling of 552345514 in words is "five hundred fifty-two million, three hundred forty-five thousand, five hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •