Base | Representation |
---|---|
bin | 1101001011011… |
… | …1000010001101 |
3 | 10212000021221201 |
4 | 3102313002031 |
5 | 103122310121 |
6 | 5252425501 |
7 | 1240556350 |
oct | 322670215 |
9 | 125007851 |
10 | 55275661 |
11 | 29224471 |
12 | 16618291 |
13 | b5b47bc |
14 | 74ac297 |
15 | 4cbce91 |
hex | 34b708d |
55275661 has 8 divisors (see below), whose sum is σ = 64364544. Its totient is φ = 46484880.
The previous prime is 55275659. The next prime is 55275677. The reversal of 55275661 is 16657255.
55275661 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 55275661 - 21 = 55275659 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 55275661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55275691) 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, 74125 + ... + 74866.
It is an arithmetic number, because the mean of its divisors is an integer number (8045568).
Almost surely, 255275661 is an apocalyptic number.
It is an amenable number.
55275661 is a deficient number, since it is larger than the sum of its proper divisors (9088883).
55275661 is a wasteful number, since it uses less digits than its factorization.
55275661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149051.
The product of its digits is 63000, while the sum is 37.
The square root of 55275661 is about 7434.7603189343. The cubic root of 55275661 is about 380.9295364577.
The spelling of 55275661 in words is "fifty-five million, two hundred seventy-five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •