Base | Representation |
---|---|
bin | 1101010011001… |
… | …0101010011010 |
3 | 10212222000120120 |
4 | 3110302222122 |
5 | 103240011132 |
6 | 5311334110 |
7 | 1245065601 |
oct | 324625232 |
9 | 125860516 |
10 | 55782042 |
11 | 2953a968 |
12 | 16821336 |
13 | b731134 |
14 | 75a0a38 |
15 | 4d6d02c |
hex | 3532a9a |
55782042 has 16 divisors (see below), whose sum is σ = 111652992. Its totient is φ = 18579200.
The previous prime is 55782029. The next prime is 55782053. The reversal of 55782042 is 24028755.
55782042 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×557820422 = 6223272419379528, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 55781994 and 55782012.
It is an unprimeable number.
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, 6703 + ... + 12509.
It is an arithmetic number, because the mean of its divisors is an integer number (6978312).
Almost surely, 255782042 is an apocalyptic number.
55782042 is an abundant number, since it is smaller than the sum of its proper divisors (55870950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55782042 is a wasteful number, since it uses less digits than its factorization.
55782042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7413.
The product of its (nonzero) digits is 22400, while the sum is 33.
The square root of 55782042 is about 7468.7376443412. The cubic root of 55782042 is about 382.0892356608.
The spelling of 55782042 in words is "fifty-five million, seven hundred eighty-two thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •