Base | Representation |
---|---|
bin | 1011011101110110… |
… | …1011110101101110 |
3 | 21221111211020001110 |
4 | 2313131223311232 |
5 | 22300432343040 |
6 | 1225232252450 |
7 | 136163446464 |
oct | 26735536556 |
9 | 7844736043 |
10 | 3078012270 |
11 | 133a5041a3 |
12 | 71a9a1126 |
13 | 3a08c9c48 |
14 | 212b12834 |
15 | 130353980 |
hex | b776bd6e |
3078012270 has 64 divisors (see below), whose sum is σ = 7582268736. Its totient is φ = 799211520.
The previous prime is 3078012263. The next prime is 3078012271. The reversal of 3078012270 is 722108703.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3078012271) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 707542 + ... + 711878.
It is an arithmetic number, because the mean of its divisors is an integer number (118472949).
Almost surely, 23078012270 is an apocalyptic number.
3078012270 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 3078012270, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3791134368).
3078012270 is an abundant number, since it is smaller than the sum of its proper divisors (4504256466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3078012270 is a wasteful number, since it uses less digits than its factorization.
3078012270 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4965.
The product of its (nonzero) digits is 4704, while the sum is 30.
The square root of 3078012270 is about 55479.8366075460. The cubic root of 3078012270 is about 1454.6442086561.
The spelling of 3078012270 in words is "three billion, seventy-eight million, twelve thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •