Base | Representation |
---|---|
bin | 1001000110111111… |
… | …10101010101000000 |
3 | 110121211100220001000 |
4 | 10203133311111000 |
5 | 40003432433002 |
6 | 2125140412000 |
7 | 232122455334 |
oct | 44337652500 |
9 | 13554326030 |
10 | 4890514752 |
11 | 208a628132 |
12 | b459a7000 |
13 | 5cc276916 |
14 | 3457217c4 |
15 | 1d952b61c |
hex | 1237f5540 |
4890514752 has 112 divisors (see below), whose sum is σ = 14399971200. Its totient is φ = 1627591680.
The previous prime is 4890514721. The next prime is 4890514757. The reversal of 4890514752 is 2574150984.
4890514752 is a `hidden beast` number, since 4 + 89 + 0 + 514 + 7 + 52 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 4890514698 and 4890514707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4890514757) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1313149 + ... + 1316867.
Almost surely, 24890514752 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 4890514752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7199985600).
4890514752 is an abundant number, since it is smaller than the sum of its proper divisors (9509456448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4890514752 is a wasteful number, since it uses less digits than its factorization.
4890514752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4501 (or 4485 counting only the distinct ones).
The product of its (nonzero) digits is 403200, while the sum is 45.
The square root of 4890514752 is about 69932.2154089229. The cubic root of 4890514752 is about 1697.4025792262.
The spelling of 4890514752 in words is "four billion, eight hundred ninety million, five hundred fourteen thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •