Base | Representation |
---|---|
bin | 1000110010100010100… |
… | …01010110000110111100 |
3 | 1001212112200101012020121 |
4 | 10121101101112012330 |
5 | 14422004332242340 |
6 | 350424140224324 |
7 | 30551055642664 |
oct | 4312121260674 |
9 | 1055480335217 |
10 | 302011212220 |
11 | 10709a501863 |
12 | 4a646b3b0a4 |
13 | 22630700503 |
14 | 108902b91a4 |
15 | 7cc903894a |
hex | 46514561bc |
302011212220 has 12 divisors (see below), whose sum is σ = 634223545704. Its totient is φ = 120804484880.
The previous prime is 302011212197. The next prime is 302011212241. The reversal of 302011212220 is 22212110203.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 302011212194 and 302011212203.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7550280286 + ... + 7550280325.
It is an arithmetic number, because the mean of its divisors is an integer number (52851962142).
Almost surely, 2302011212220 is an apocalyptic number.
It is an amenable number.
302011212220 is an abundant number, since it is smaller than the sum of its proper divisors (332212333484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
302011212220 is a wasteful number, since it uses less digits than its factorization.
302011212220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15100560620 (or 15100560618 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 302011212220 its reverse (22212110203), we get a palindrome (324223322423).
It can be divided in two parts, 30201 and 1212220, that added together give a palindrome (1242421).
The spelling of 302011212220 in words is "three hundred two billion, eleven million, two hundred twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •