Base | Representation |
---|---|
bin | 1101001101100… |
… | …0101001001011 |
3 | 10212021021210022 |
4 | 3103120221023 |
5 | 103141211243 |
6 | 5255411055 |
7 | 1242001610 |
oct | 323305113 |
9 | 125237708 |
10 | 55413323 |
11 | 29308939 |
12 | 16683a8b |
13 | b632364 |
14 | 7506507 |
15 | 4ce8b68 |
hex | 34d8a4b |
55413323 has 8 divisors (see below), whose sum is σ = 63786240. Its totient is φ = 47154600.
The previous prime is 55413301. The next prime is 55413343. The reversal of 55413323 is 32331455.
55413323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 55413323 - 28 = 55413067 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 55413292 and 55413301.
It is not an unprimeable number, because it can be changed into a prime (55413343) 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, 27503 + ... + 29448.
It is an arithmetic number, because the mean of its divisors is an integer number (7973280).
Almost surely, 255413323 is an apocalyptic number.
55413323 is a deficient number, since it is larger than the sum of its proper divisors (8372917).
55413323 is a wasteful number, since it uses less digits than its factorization.
55413323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57097.
The product of its digits is 5400, while the sum is 26.
The square root of 55413323 is about 7444.0125604408. The cubic root of 55413323 is about 381.2455046321.
Adding to 55413323 its reverse (32331455), we get a palindrome (87744778).
The spelling of 55413323 in words is "fifty-five million, four hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •