Base | Representation |
---|---|
bin | 1001001110111010… |
… | …11011000100010000 |
3 | 110210110110021100102 |
4 | 10213131123010100 |
5 | 40122442214020 |
6 | 2135513311532 |
7 | 233560510010 |
oct | 44735330420 |
9 | 13713407312 |
10 | 4956991760 |
11 | 2114102306 |
12 | b641055a8 |
13 | 60cc80a26 |
14 | 3504a7c40 |
15 | 1e02ad475 |
hex | 12775b110 |
4956991760 has 240 divisors, whose sum is σ = 13924751616. Its totient is φ = 1607040000.
The previous prime is 4956991759. The next prime is 4956991789. The reversal of 4956991760 is 671996594.
It is a Harshad number since it is a multiple of its sum of digits (56).
It is a junction number, because it is equal to n+sod(n) for n = 4956991696 and 4956991705.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 32827685 + ... + 32827835.
Almost surely, 24956991760 is an apocalyptic number.
4956991760 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 4956991760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6962375808).
4956991760 is an abundant number, since it is smaller than the sum of its proper divisors (8967759856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4956991760 is a wasteful number, since it uses less digits than its factorization.
4956991760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294 (or 257 counting only the distinct ones).
The product of its (nonzero) digits is 3674160, while the sum is 56.
The square root of 4956991760 is about 70405.9071385349. The cubic root of 4956991760 is about 1705.0589511298.
The spelling of 4956991760 in words is "four billion, nine hundred fifty-six million, nine hundred ninety-one thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •