Base | Representation |
---|---|
bin | 1101010011000… |
… | …0101101100101 |
3 | 10212221121121200 |
4 | 3110300231211 |
5 | 103234232203 |
6 | 5311233113 |
7 | 1245033366 |
oct | 324605545 |
9 | 125847550 |
10 | 55774053 |
11 | 29534965 |
12 | 16818799 |
13 | b72a5ca |
14 | 759bb6d |
15 | 4d6a9a3 |
hex | 3530b65 |
55774053 has 24 divisors (see below), whose sum is σ = 85113600. Its totient is φ = 35138880.
The previous prime is 55774031. The next prime is 55774067. The reversal of 55774053 is 35047755.
55774053 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 55774053 - 25 = 55774021 is a prime.
It is a super-2 number, since 2×557740532 = 6221489976093618, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55773999 and 55774017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55774003) 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, 9673 + ... + 14321.
It is an arithmetic number, because the mean of its divisors is an integer number (3546400).
Almost surely, 255774053 is an apocalyptic number.
It is an amenable number.
55774053 is a deficient number, since it is larger than the sum of its proper divisors (29339547).
55774053 is a wasteful number, since it uses less digits than its factorization.
55774053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4729 (or 4726 counting only the distinct ones).
The product of its (nonzero) digits is 73500, while the sum is 36.
The square root of 55774053 is about 7468.2027958539. The cubic root of 55774053 is about 382.0709940874.
The spelling of 55774053 in words is "fifty-five million, seven hundred seventy-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •