Base | Representation |
---|---|
bin | 1001001000111010… |
… | …01111010101110000 |
3 | 110122221122201102100 |
4 | 10210131033111300 |
5 | 40022043041310 |
6 | 2130513420400 |
7 | 232406341326 |
oct | 44435172560 |
9 | 13587581370 |
10 | 4906612080 |
11 | 2098722307 |
12 | b4b26a700 |
13 | 6026c1876 |
14 | 347911d16 |
15 | 1dab5aec0 |
hex | 12474f570 |
4906612080 has 480 divisors, whose sum is σ = 18865042560. Its totient is φ = 1135411200.
The previous prime is 4906612049. The next prime is 4906612129. The reversal of 4906612080 is 802166094.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 8163780 + ... + 8164380.
It is an arithmetic number, because the mean of its divisors is an integer number (39302172).
Almost surely, 24906612080 is an apocalyptic number.
4906612080 is a gapful number since it is divisible by the number (40) 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 4906612080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9432521280).
4906612080 is an abundant number, since it is smaller than the sum of its proper divisors (13958430480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4906612080 is a wasteful number, since it uses less digits than its factorization.
4906612080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 689 (or 680 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The square root of 4906612080 is about 70047.2132207984. The cubic root of 4906612080 is about 1699.2628961312.
The spelling of 4906612080 in words is "four billion, nine hundred six million, six hundred twelve thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •