Base | Representation |
---|---|
bin | 1101010001100… |
… | …0100111001101 |
3 | 10212202121012200 |
4 | 3110120213031 |
5 | 103223102331 |
6 | 5305152113 |
7 | 1244142531 |
oct | 324304715 |
9 | 125677180 |
10 | 55675341 |
11 | 29477787 |
12 | 1678b639 |
13 | b6c46b7 |
14 | 7573bc1 |
15 | 4d4b5e6 |
hex | 35189cd |
55675341 has 24 divisors (see below), whose sum is σ = 84779136. Its totient is φ = 35138400.
The previous prime is 55675327. The next prime is 55675363. The reversal of 55675341 is 14357655.
55675341 is a `hidden beast` number, since 5 + 567 + 53 + 41 = 666.
55675341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 55675341 - 25 = 55675309 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 55675296 and 55675305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55675141) 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 23 ways as a sum of consecutive naturals, for example, 19576 + ... + 22238.
It is an arithmetic number, because the mean of its divisors is an integer number (3532464).
Almost surely, 255675341 is an apocalyptic number.
It is an amenable number.
55675341 is a deficient number, since it is larger than the sum of its proper divisors (29103795).
55675341 is a wasteful number, since it uses less digits than its factorization.
55675341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2793 (or 2790 counting only the distinct ones).
The product of its digits is 63000, while the sum is 36.
The square root of 55675341 is about 7461.5910501715. The cubic root of 55675341 is about 381.8454575289.
The spelling of 55675341 in words is "fifty-five million, six hundred seventy-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •