Base | Representation |
---|---|
bin | 1001001100110110… |
… | …01000111010000000 |
3 | 110202020202111010000 |
4 | 10212123020322000 |
5 | 40104020201442 |
6 | 2134053040000 |
7 | 233260020312 |
oct | 44633107200 |
9 | 13666674100 |
10 | 4939615872 |
11 | 2105314574 |
12 | b5a326000 |
13 | 6094a8b39 |
14 | 34c0637b2 |
15 | 1dd9c9d4c |
hex | 1266c8e80 |
4939615872 has 80 divisors (see below), whose sum is σ = 14700247650. Its totient is φ = 1646535168.
The previous prime is 4939615871. The next prime is 4939615873. The reversal of 4939615872 is 2785169394.
It is an interprime number because it is at equal distance from previous prime (4939615871) and next prime (4939615873).
It can be written as a sum of positive squares in only one way, i.e., 4512614976 + 427000896 = 67176^2 + 20664^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (4939615871) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 227847 + ... + 248582.
Almost surely, 24939615872 is an apocalyptic number.
It is an amenable number.
4939615872 is an abundant number, since it is smaller than the sum of its proper divisors (9760631778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4939615872 is an equidigital number, since it uses as much as digits as its factorization.
4939615872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 476455 (or 476434 counting only the distinct ones).
The product of its digits is 3265920, while the sum is 54.
The square root of 4939615872 is about 70282.4008696345. The cubic root of 4939615872 is about 1703.0643544242.
The spelling of 4939615872 in words is "four billion, nine hundred thirty-nine million, six hundred fifteen thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •