Base | Representation |
---|---|
bin | 1001000010010011… |
… | …01010010001000000 |
3 | 110112002021211210020 |
4 | 10201021222101000 |
5 | 34413343212330 |
6 | 2121212533440 |
7 | 231134035110 |
oct | 44111522100 |
9 | 13462254706 |
10 | 4851147840 |
11 | 206a38a1a0 |
12 | b34781280 |
13 | 5c40722a6 |
14 | 3403d5040 |
15 | 1d5d52210 |
hex | 12126a440 |
4851147840 has 896 divisors, whose sum is σ = 20786872320. Its totient is φ = 928972800.
The previous prime is 4851147781. The next prime is 4851147881. The reversal of 4851147840 is 487411584.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 4851147792 and 4851147801.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 66454044 + ... + 66454116.
Almost surely, 24851147840 is an apocalyptic number.
4851147840 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4851147840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10393436160).
4851147840 is an abundant number, since it is smaller than the sum of its proper divisors (15935724480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4851147840 is a wasteful number, since it uses less digits than its factorization.
4851147840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171 (or 161 counting only the distinct ones).
The product of its (nonzero) digits is 143360, while the sum is 42.
The square root of 4851147840 is about 69650.1819093102. The cubic root of 4851147840 is about 1692.8358070168.
The spelling of 4851147840 in words is "four billion, eight hundred fifty-one million, one hundred forty-seven thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •