Base | Representation |
---|---|
bin | 10001111100010… |
… | …011001101110101 |
3 | 202222102101211200 |
4 | 101330103031311 |
5 | 1104030120041 |
6 | 45511523113 |
7 | 10313425251 |
oct | 2174231565 |
9 | 688371750 |
10 | 301020021 |
11 | 144a10885 |
12 | 84989499 |
13 | 4a497173 |
14 | 2bd9b261 |
15 | 1b6611b6 |
hex | 11f13375 |
301020021 has 24 divisors (see below), whose sum is σ = 477597120. Its totient is φ = 181849536.
The previous prime is 301020017. The next prime is 301020023. The reversal of 301020021 is 120020103.
It is a happy number.
It is not a de Polignac number, because 301020021 - 22 = 301020017 is a prime.
It is a super-2 number, since 2×3010200212 = 181226106085680882, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 301019985 and 301020012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301020023) 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, 34336 + ... + 42201.
It is an arithmetic number, because the mean of its divisors is an integer number (19899880).
Almost surely, 2301020021 is an apocalyptic number.
It is an amenable number.
301020021 is a deficient number, since it is larger than the sum of its proper divisors (176577099).
301020021 is a wasteful number, since it uses less digits than its factorization.
301020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76585 (or 76582 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 301020021 is about 17349.9285589307. The cubic root of 301020021 is about 670.1907981148.
Adding to 301020021 its reverse (120020103), we get a palindrome (421040124).
The spelling of 301020021 in words is "three hundred one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •