Base | Representation |
---|---|
bin | 1101001001100… |
… | …0101000101001 |
3 | 10211202222011000 |
4 | 3102120220221 |
5 | 103104314040 |
6 | 5250025213 |
7 | 1236530340 |
oct | 322305051 |
9 | 124688130 |
10 | 55151145 |
11 | 29149965 |
12 | 16578209 |
13 | b56cc1a |
14 | 7478b57 |
15 | 4c96130 |
hex | 3498a29 |
55151145 has 64 divisors (see below), whose sum is σ = 118679040. Its totient is φ = 23721984.
The previous prime is 55151143. The next prime is 55151183. The reversal of 55151145 is 54115155.
55151145 is a `hidden beast` number, since 5 + 515 + 1 + 145 = 666.
It is not a de Polignac number, because 55151145 - 21 = 55151143 is a prime.
It is a super-2 number, since 2×551511452 = 6083297589622050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (55151143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 14349 + ... + 17781.
It is an arithmetic number, because the mean of its divisors is an integer number (1854360).
Almost surely, 255151145 is an apocalyptic number.
It is an amenable number.
55151145 is an abundant number, since it is smaller than the sum of its proper divisors (63527895).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55151145 is a wasteful number, since it uses less digits than its factorization.
55151145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3471 (or 3465 counting only the distinct ones).
The product of its digits is 2500, while the sum is 27.
The square root of 55151145 is about 7426.3816896252. The cubic root of 55151145 is about 380.6432894218.
The spelling of 55151145 in words is "fifty-five million, one hundred fifty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •