Base | Representation |
---|---|
bin | 1101010100000… |
… | …0110110000011 |
3 | 10220001222021000 |
4 | 3111000312003 |
5 | 103243341011 |
6 | 5312503043 |
7 | 1245430134 |
oct | 325006603 |
9 | 126058230 |
10 | 55840131 |
11 | 2957a576 |
12 | 1684aa83 |
13 | b7516c9 |
14 | 75b7c8b |
15 | 4d80356 |
hex | 3540d83 |
55840131 has 16 divisors (see below), whose sum is σ = 82871200. Its totient is φ = 37161504.
The previous prime is 55840117. The next prime is 55840133. The reversal of 55840131 is 13104855.
It is not a de Polignac number, because 55840131 - 27 = 55840003 is a prime.
It is a super-2 number, since 2×558401312 = 6236240460194322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55840095 and 55840104.
It is not an unprimeable number, because it can be changed into a prime (55840133) 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 15 ways as a sum of consecutive naturals, for example, 17685 + ... + 20601.
It is an arithmetic number, because the mean of its divisors is an integer number (5179450).
Almost surely, 255840131 is an apocalyptic number.
55840131 is a deficient number, since it is larger than the sum of its proper divisors (27031069).
55840131 is a wasteful number, since it uses less digits than its factorization.
55840131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3635 (or 3629 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The square root of 55840131 is about 7472.6254422392. The cubic root of 55840131 is about 382.2218200368.
Adding to 55840131 its reverse (13104855), we get a palindrome (68944986).
The spelling of 55840131 in words is "fifty-five million, eight hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •