Base | Representation |
---|---|
bin | 1101010001101… |
… | …0000100111101 |
3 | 10212202220102220 |
4 | 3110122010331 |
5 | 103223300331 |
6 | 5305235553 |
7 | 1244166162 |
oct | 324320475 |
9 | 125686386 |
10 | 55681341 |
11 | 29481241 |
12 | 16792bb9 |
13 | b6c7351 |
14 | 7576069 |
15 | 4d4d296 |
hex | 351a13d |
55681341 has 12 divisors (see below), whose sum is σ = 78867072. Its totient is φ = 34936768.
The previous prime is 55681331. The next prime is 55681357. The reversal of 55681341 is 14318655.
55681341 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 55681341 - 211 = 55679293 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55681331) 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 11 ways as a sum of consecutive naturals, for example, 31245 + ... + 32978.
It is an arithmetic number, because the mean of its divisors is an integer number (6572256).
Almost surely, 255681341 is an apocalyptic number.
55681341 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
55681341 is a deficient number, since it is larger than the sum of its proper divisors (23185731).
55681341 is a wasteful number, since it uses less digits than its factorization.
55681341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64260 (or 64243 counting only the distinct ones).
The product of its digits is 14400, while the sum is 33.
The square root of 55681341 is about 7461.9930983619. The cubic root of 55681341 is about 381.8591738972.
Adding to 55681341 its reverse (14318655), we get a palindrome (69999996).
The spelling of 55681341 in words is "fifty-five million, six hundred eighty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •