Base | Representation |
---|---|
bin | 1101001011001… |
… | …1010111011000 |
3 | 10211222112100002 |
4 | 3102303113120 |
5 | 103121320012 |
6 | 5252232132 |
7 | 1240464500 |
oct | 322632730 |
9 | 124875302 |
10 | 55260632 |
11 | 29214149 |
12 | 1660b648 |
13 | b5aa9cb |
14 | 74a6a00 |
15 | 4cb87c2 |
hex | 34b35d8 |
55260632 has 48 divisors (see below), whose sum is σ = 122559120. Its totient is φ = 23284800.
The previous prime is 55260619. The next prime is 55260637. The reversal of 55260632 is 23606255.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 55260595 and 55260604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55260637) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22757 + ... + 25067.
It is an arithmetic number, because the mean of its divisors is an integer number (2553315).
Almost surely, 255260632 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 55260632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61279560).
55260632 is an abundant number, since it is smaller than the sum of its proper divisors (67298488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55260632 is a wasteful number, since it uses less digits than its factorization.
55260632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2392 (or 2381 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 55260632 is about 7433.7495249706. The cubic root of 55260632 is about 380.8950094535.
Adding to 55260632 its reverse (23606255), we get a palindrome (78866887).
The spelling of 55260632 in words is "fifty-five million, two hundred sixty thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •