Base | Representation |
---|---|
bin | 1101001000001… |
… | …1000111110110 |
3 | 10211121111021111 |
4 | 3102003013312 |
5 | 103044004110 |
6 | 5244105234 |
7 | 1236012421 |
oct | 322030766 |
9 | 124544244 |
10 | 55063030 |
11 | 29099740 |
12 | 1653521a |
13 | b53ba99 |
14 | 74549b8 |
15 | 4c79e8a |
hex | 34831f6 |
55063030 has 64 divisors (see below), whose sum is σ = 113073408. Its totient is φ = 19128960.
The previous prime is 55063003. The next prime is 55063031. The reversal of 55063030 is 3036055.
55063030 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 55062992 and 55063010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55063031) 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 31 ways as a sum of consecutive naturals, for example, 337729 + ... + 337891.
It is an arithmetic number, because the mean of its divisors is an integer number (1766772).
Almost surely, 255063030 is an apocalyptic number.
55063030 is an abundant number, since it is smaller than the sum of its proper divisors (58010378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55063030 is a wasteful number, since it uses less digits than its factorization.
55063030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 301.
The product of its (nonzero) digits is 1350, while the sum is 22.
The square root of 55063030 is about 7420.4467520494. The cubic root of 55063030 is about 380.4404634012.
Adding to 55063030 its reverse (3036055), we get a palindrome (58099085).
The spelling of 55063030 in words is "fifty-five million, sixty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •