Base | Representation |
---|---|
bin | 1011101001110111001010 |
3 | 12202012202000 |
4 | 23221313022 |
5 | 1240230200 |
6 | 145251430 |
7 | 34652565 |
oct | 13516712 |
9 | 5665660 |
10 | 3055050 |
11 | 17a7339 |
12 | 1033b76 |
13 | 82c72b |
14 | 5974dc |
15 | 405300 |
hex | 2e9dca |
3055050 has 96 divisors (see below), whose sum is σ = 8808960. Its totient is φ = 777600.
The previous prime is 3055049. The next prime is 3055057. The reversal of 3055050 is 505503.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3055057) 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 47 ways as a sum of consecutive naturals, for example, 41814 + ... + 41886.
It is an arithmetic number, because the mean of its divisors is an integer number (91760).
Almost surely, 23055050 is an apocalyptic number.
3055050 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 3055050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4404480).
3055050 is an abundant number, since it is smaller than the sum of its proper divisors (5753910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3055050 is a wasteful number, since it uses less digits than its factorization.
3055050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125 (or 114 counting only the distinct ones).
The product of its (nonzero) digits is 375, while the sum is 18.
The square root of 3055050 is about 1747.8701324755. The cubic root of 3055050 is about 145.1017913864.
The spelling of 3055050 in words is "three million, fifty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •