Base | Representation |
---|---|
bin | 1010000001101… |
… | …1011000001101 |
3 | 2221010121212022 |
4 | 2200123120031 |
5 | 41231231211 |
6 | 4101215525 |
7 | 1020314600 |
oct | 240333015 |
9 | 87117768 |
10 | 42055181 |
11 | 21814753 |
12 | 121015a5 |
13 | 893612c |
14 | 582a337 |
15 | 3a5abdb |
hex | 281b60d |
42055181 has 6 divisors (see below), whose sum is σ = 48921390. Its totient is φ = 36047256.
The previous prime is 42055147. The next prime is 42055183. The reversal of 42055181 is 18155024.
It can be written as a sum of positive squares in only one way, i.e., 34409956 + 7645225 = 5866^2 + 2765^2 .
It is not a de Polignac number, because 42055181 - 210 = 42054157 is a prime.
It is a super-2 number, since 2×420551812 = 3537276497885522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 42055181.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42055183) 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 5 ways as a sum of consecutive naturals, for example, 429086 + ... + 429183.
It is an arithmetic number, because the mean of its divisors is an integer number (8153565).
Almost surely, 242055181 is an apocalyptic number.
It is an amenable number.
42055181 is a deficient number, since it is larger than the sum of its proper divisors (6866209).
42055181 is an equidigital number, since it uses as much as digits as its factorization.
42055181 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 858283 (or 858276 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 26.
The square root of 42055181 is about 6484.9966075550. The cubic root of 42055181 is about 347.7548285245.
The spelling of 42055181 in words is "forty-two million, fifty-five thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •