Base | Representation |
---|---|
bin | 1001001101111110… |
… | …01100011000010000 |
3 | 110202220112200000011 |
4 | 10212333030120100 |
5 | 40113430123110 |
6 | 2135031404304 |
7 | 233433243403 |
oct | 44677143020 |
9 | 13686480004 |
10 | 4949067280 |
11 | 210a68a553 |
12 | b61523694 |
13 | 60b437aa1 |
14 | 34d403d3a |
15 | 1de74548a |
hex | 126fcc610 |
4949067280 has 40 divisors (see below), whose sum is σ = 11582812224. Its totient is φ = 1966512000.
The previous prime is 4949067271. The next prime is 4949067289. The reversal of 4949067280 is 827609494.
It is an interprime number because it is at equal distance from previous prime (4949067271) and next prime (4949067289).
It is a tau number, because it is divible by the number of its divisors (40).
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (4949067289) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 192766 + ... + 216925.
Almost surely, 24949067280 is an apocalyptic number.
4949067280 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4949067280 is an abundant number, since it is smaller than the sum of its proper divisors (6633744944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4949067280 is a wasteful number, since it uses less digits than its factorization.
4949067280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409855 (or 409849 counting only the distinct ones).
The product of its (nonzero) digits is 870912, while the sum is 49.
The square root of 4949067280 is about 70349.6075326650. The cubic root of 4949067280 is about 1704.1498707330.
The spelling of 4949067280 in words is "four billion, nine hundred forty-nine million, sixty-seven thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •