Base | Representation |
---|---|
bin | 1100011011000… |
… | …0101000110010 |
3 | 10122001010212210 |
4 | 3012300220302 |
5 | 101314304410 |
6 | 5100432550 |
7 | 1201605630 |
oct | 306605062 |
9 | 118033783 |
10 | 52103730 |
11 | 27458338 |
12 | 15548756 |
13 | aa43b13 |
14 | 6cc4350 |
15 | 4893220 |
hex | 31b0a32 |
52103730 has 64 divisors (see below), whose sum is σ = 145981440. Its totient is φ = 11653824.
The previous prime is 52103729. The next prime is 52103767. The reversal of 52103730 is 3730125.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 52103697 and 52103706.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 7231 + ... + 12509.
It is an arithmetic number, because the mean of its divisors is an integer number (2280960).
Almost surely, 252103730 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52103730, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72990720).
52103730 is an abundant number, since it is smaller than the sum of its proper divisors (93877710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52103730 is a wasteful number, since it uses less digits than its factorization.
52103730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5343.
The product of its (nonzero) digits is 630, while the sum is 21.
The square root of 52103730 is about 7218.2913490659. The cubic root of 52103730 is about 373.4991389008.
Adding to 52103730 its reverse (3730125), we get a palindrome (55833855).
The spelling of 52103730 in words is "fifty-two million, one hundred three thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •