Base | Representation |
---|---|
bin | 1011001110001000… |
… | …0100000100010100 |
3 | 21202220201001111121 |
4 | 2303202010010110 |
5 | 22132041114340 |
6 | 1214514413324 |
7 | 134433004303 |
oct | 26342040424 |
9 | 7686631447 |
10 | 3012051220 |
11 | 1306251732 |
12 | 700891244 |
13 | 390043939 |
14 | 20806243a |
15 | 12967494a |
hex | b3884114 |
3012051220 has 12 divisors (see below), whose sum is σ = 6325307604. Its totient is φ = 1204820480.
The previous prime is 3012051199. The next prime is 3012051239. The reversal of 3012051220 is 221502103.
It can be written as a sum of positive squares in 2 ways, for example, as 648924676 + 2363126544 = 25474^2 + 48612^2 .
It is a junction number, because it is equal to n+sod(n) for n = 3012051194 and 3012051203.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 75301261 + ... + 75301300.
It is an arithmetic number, because the mean of its divisors is an integer number (527108967).
Almost surely, 23012051220 is an apocalyptic number.
It is an amenable number.
3012051220 is an abundant number, since it is smaller than the sum of its proper divisors (3313256384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3012051220 is a wasteful number, since it uses less digits than its factorization.
3012051220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150602570 (or 150602568 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 3012051220 is about 54882.1575742062. The cubic root of 3012051220 is about 1444.1781975587.
Adding to 3012051220 its reverse (221502103), we get a palindrome (3233553323).
The spelling of 3012051220 in words is "three billion, twelve million, fifty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •