Base | Representation |
---|---|
bin | 1001001110010100… |
… | …01110010000000000 |
3 | 110210002222120001102 |
4 | 10213022032100000 |
5 | 40120200133103 |
6 | 2135213353532 |
7 | 233466644606 |
oct | 44712162000 |
9 | 13702876042 |
10 | 4951958528 |
11 | 2111284810 |
12 | b624988a8 |
13 | 60bc0aa9a |
14 | 34d957876 |
15 | 1deb16e88 |
hex | 12728e400 |
4951958528 has 88 divisors (see below), whose sum is σ = 10977553344. Its totient is φ = 2213683200.
The previous prime is 4951958521. The next prime is 4951958537. The reversal of 4951958528 is 8258591594.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (88).
It is not an unprimeable number, because it can be changed into a prime (4951958521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 683501 + ... + 690707.
Almost surely, 24951958528 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 4951958528, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5488776672).
4951958528 is an abundant number, since it is smaller than the sum of its proper divisors (6025594816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4951958528 is a wasteful number, since it uses less digits than its factorization.
4951958528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7299 (or 7281 counting only the distinct ones).
The product of its digits is 5184000, while the sum is 56.
The square root of 4951958528 is about 70370.1536732726. The cubic root of 4951958528 is about 1704.4816612478.
The spelling of 4951958528 in words is "four billion, nine hundred fifty-one million, nine hundred fifty-eight thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •