Base | Representation |
---|---|
bin | 1001000111110100… |
… | …00111010010010000 |
3 | 110122022022220101010 |
4 | 10203322013102100 |
5 | 40012213412143 |
6 | 2125544210520 |
7 | 232235150625 |
oct | 44372072220 |
9 | 13568286333 |
10 | 4897404048 |
11 | 2093503169 |
12 | b48169a40 |
13 | 600819624 |
14 | 3465d634c |
15 | 1d9e3ca33 |
hex | 123e87490 |
4897404048 has 20 divisors (see below), whose sum is σ = 12651627248. Its totient is φ = 1632468000.
The previous prime is 4897404041. The next prime is 4897404151. The reversal of 4897404048 is 8404047984.
It is a Harshad number since it is a multiple of its sum of digits (48), and also a Moran number because the ratio is a prime number: 102029251 = 4897404048 / (4 + 8 + 9 + 7 + 4 + 0 + 4 + 0 + 4 + 8).
It is a junction number, because it is equal to n+sod(n) for n = 4897403988 and 4897404006.
It is not an unprimeable number, because it can be changed into a prime (4897404041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51014578 + ... + 51014673.
Almost surely, 24897404048 is an apocalyptic number.
4897404048 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
4897404048 is an abundant number, since it is smaller than the sum of its proper divisors (7754223200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4897404048 is a wasteful number, since it uses less digits than its factorization.
4897404048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102029262 (or 102029256 counting only the distinct ones).
The product of its (nonzero) digits is 1032192, while the sum is 48.
The square root of 4897404048 is about 69981.4550291718. The cubic root of 4897404048 is about 1698.1992521460.
The spelling of 4897404048 in words is "four billion, eight hundred ninety-seven million, four hundred four thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •