Base | Representation |
---|---|
bin | 100000111001111… |
… | …011001000000011 |
3 | 1102110210022111120 |
4 | 200321323020003 |
5 | 2112311232144 |
6 | 130440243323 |
7 | 16452251445 |
oct | 4071731003 |
9 | 1373708446 |
10 | 552055299 |
11 | 263691354 |
12 | 134a70543 |
13 | 8a4acb53 |
14 | 53466495 |
15 | 336ebe19 |
hex | 20e7b203 |
552055299 has 8 divisors (see below), whose sum is σ = 736258320. Its totient is φ = 367944576.
The previous prime is 552055291. The next prime is 552055321. The reversal of 552055299 is 992550255.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 552055299 - 23 = 552055291 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 552055299.
It is not an unprimeable number, because it can be changed into a prime (552055291) 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, 7642 + ... + 34095.
It is an arithmetic number, because the mean of its divisors is an integer number (92032290).
Almost surely, 2552055299 is an apocalyptic number.
552055299 is a deficient number, since it is larger than the sum of its proper divisors (184203021).
552055299 is a wasteful number, since it uses less digits than its factorization.
552055299 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46149.
The product of its (nonzero) digits is 202500, while the sum is 42.
The square root of 552055299 is about 23495.8570603415. The cubic root of 552055299 is about 820.3405778391.
The spelling of 552055299 in words is "five hundred fifty-two million, fifty-five thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •