Base | Representation |
---|---|
bin | 10010000101000… |
… | …000000110011100 |
3 | 210010201021210010 |
4 | 102011000012130 |
5 | 1110121113040 |
6 | 50032443220 |
7 | 10342005351 |
oct | 2205000634 |
9 | 703637703 |
10 | 303301020 |
11 | 146229600 |
12 | 856a9510 |
13 | 4aab5479 |
14 | 2c3d2628 |
15 | 1b961e80 |
hex | 1214019c |
303301020 has 72 divisors (see below), whose sum is σ = 933487632. Its totient is φ = 73525760.
The previous prime is 303300979. The next prime is 303301021. The reversal of 303301020 is 20103303.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 303300987 and 303301005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (303301021) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13629 + ... + 28148.
It is an arithmetic number, because the mean of its divisors is an integer number (12965106).
Almost surely, 2303301020 is an apocalyptic number.
303301020 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
303301020 is an abundant number, since it is smaller than the sum of its proper divisors (630186612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
303301020 is a wasteful number, since it uses less digits than its factorization.
303301020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41811 (or 41798 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 12.
The square root of 303301020 is about 17415.5396126563. The cubic root of 303301020 is about 671.8793451891.
Adding to 303301020 its reverse (20103303), we get a palindrome (323404323).
The spelling of 303301020 in words is "three hundred three million, three hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •