Base | Representation |
---|---|
bin | 1011010111011100… |
… | …0110011100110100 |
3 | 21212122012222101121 |
4 | 2311313012130310 |
5 | 22222041323221 |
6 | 1222432033324 |
7 | 135416044600 |
oct | 26567063464 |
9 | 7778188347 |
10 | 3051120436 |
11 | 1326306a41 |
12 | 711992844 |
13 | 398172910 |
14 | 20d312500 |
15 | 12cce0a41 |
hex | b5dc6734 |
3051120436 has 72 divisors (see below), whose sum is σ = 6701412480. Its totient is φ = 1204797888.
The previous prime is 3051120431. The next prime is 3051120451. The reversal of 3051120436 is 6340211503.
It is a self number, because there is not a number n which added to its sum of digits gives 3051120436.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3051120431) 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, 2340961 + ... + 2342263.
Almost surely, 23051120436 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3051120436, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3350706240).
3051120436 is an abundant number, since it is smaller than the sum of its proper divisors (3650292044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3051120436 is a wasteful number, since it uses less digits than its factorization.
3051120436 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2253 (or 2244 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 3051120436 is about 55236.9481054122. The cubic root of 3051120436 is about 1450.3955220664.
Adding to 3051120436 its reverse (6340211503), we get a palindrome (9391331939).
The spelling of 3051120436 in words is "three billion, fifty-one million, one hundred twenty thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •