Base | Representation |
---|---|
bin | 1011011101011011… |
… | …0100011100000000 |
3 | 21221101102210012120 |
4 | 2313112310130000 |
5 | 22300002244410 |
6 | 1225125524240 |
7 | 136142242335 |
oct | 26726643400 |
9 | 7841383176 |
10 | 3076212480 |
11 | 1339494a70 |
12 | 71a273680 |
13 | 3a0419993 |
14 | 2127a498c |
15 | 1300ea570 |
hex | b75b4700 |
3076212480 has 288 divisors, whose sum is σ = 11284842240. Its totient is φ = 706314240.
The previous prime is 3076212479. The next prime is 3076212541. The reversal of 3076212480 is 842126703.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 800644 + ... + 804476.
It is an arithmetic number, because the mean of its divisors is an integer number (39183480).
Almost surely, 23076212480 is an apocalyptic number.
3076212480 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3076212480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5642421120).
3076212480 is an abundant number, since it is smaller than the sum of its proper divisors (8208629760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3076212480 is a wasteful number, since it uses less digits than its factorization.
3076212480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3887 (or 3873 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 33.
The square root of 3076212480 is about 55463.6140185618. The cubic root of 3076212480 is about 1454.3606312132.
The spelling of 3076212480 in words is "three billion, seventy-six million, two hundred twelve thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •