Base | Representation |
---|---|
bin | 1001001000010010… |
… | …11000110101000000 |
3 | 110122120212022212000 |
4 | 10210021120311000 |
5 | 40014230024224 |
6 | 2130210104000 |
7 | 232314165300 |
oct | 44411306500 |
9 | 13576768760 |
10 | 4901408064 |
11 | 2095798473 |
12 | b4957b000 |
13 | 6015bbc77 |
14 | 346d59600 |
15 | 1da47e0c9 |
hex | 124258d40 |
4901408064 has 336 divisors, whose sum is σ = 16949684160. Its totient is φ = 1384750080.
The previous prime is 4901408051. The next prime is 4901408081. The reversal of 4901408064 is 4608041094.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (336).
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 pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9059634 + ... + 9060174.
Almost surely, 24901408064 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 4901408064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8474842080).
4901408064 is an abundant number, since it is smaller than the sum of its proper divisors (12048276096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4901408064 is a wasteful number, since it uses less digits than its factorization.
4901408064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683 (or 660 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The square root of 4901408064 is about 70010.0568775658. The cubic root of 4901408064 is about 1698.6619302421.
The spelling of 4901408064 in words is "four billion, nine hundred one million, four hundred eight thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •