Base | Representation |
---|---|
bin | 1000110001000011010… |
… | …01011100011011110100 |
3 | 1001210110222221100101102 |
4 | 10120201221130123310 |
5 | 14413340312120340 |
6 | 350212555145232 |
7 | 30522214436666 |
oct | 4304151343364 |
9 | 1053428840342 |
10 | 301212223220 |
11 | 10681a4a1577 |
12 | 4a463445218 |
13 | 2253401285c |
14 | 10816134536 |
15 | 7c7dd11215 |
hex | 4621a5c6f4 |
301212223220 has 48 divisors (see below), whose sum is σ = 634995356688. Its totient is φ = 120018554880.
The previous prime is 301212223211. The next prime is 301212223289. The reversal of 301212223220 is 22322212103.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 5767794916 + 295444428304 = 75946^2 + 543548^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 301212223192 and 301212223201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24142904 + ... + 24155376.
It is an arithmetic number, because the mean of its divisors is an integer number (13229069931).
Almost surely, 2301212223220 is an apocalyptic number.
It is an amenable number.
301212223220 is an abundant number, since it is smaller than the sum of its proper divisors (333783133468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
301212223220 is a wasteful number, since it uses less digits than its factorization.
301212223220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17060 (or 17058 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 301212223220 its reverse (22322212103), we get a palindrome (323534435323).
The spelling of 301212223220 in words is "three hundred one billion, two hundred twelve million, two hundred twenty-three thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •