Base | Representation |
---|---|
bin | 1101010000101… |
… | …1001101100101 |
3 | 10212122210220210 |
4 | 3110023031211 |
5 | 103214323303 |
6 | 5304050033 |
7 | 1243523520 |
oct | 324131545 |
9 | 125583823 |
10 | 55620453 |
11 | 2943a519 |
12 | 16763919 |
13 | b6a5715 |
14 | 755bbb7 |
15 | 4d3a203 |
hex | 350b365 |
55620453 has 8 divisors (see below), whose sum is σ = 84755008. Its totient is φ = 31783104.
The previous prime is 55620451. The next prime is 55620469. The reversal of 55620453 is 35402655.
55620453 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 not a de Polignac number, because 55620453 - 21 = 55620451 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 55620453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55620451) 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, 1324276 + ... + 1324317.
It is an arithmetic number, because the mean of its divisors is an integer number (10594376).
Almost surely, 255620453 is an apocalyptic number.
It is an amenable number.
55620453 is a deficient number, since it is larger than the sum of its proper divisors (29134555).
55620453 is a wasteful number, since it uses less digits than its factorization.
55620453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2648603.
The product of its (nonzero) digits is 18000, while the sum is 30.
The square root of 55620453 is about 7457.9121072858. The cubic root of 55620453 is about 381.7199344259.
The spelling of 55620453 in words is "fifty-five million, six hundred twenty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •