Base | Representation |
---|---|
bin | 1001000000000111… |
… | …10100000110011000 |
3 | 110110210211121110111 |
4 | 10200003310012120 |
5 | 34344201304130 |
6 | 2115320254104 |
7 | 230522305552 |
oct | 44003640630 |
9 | 13423747414 |
10 | 4832838040 |
11 | 2060013828 |
12 | b2a611334 |
13 | 5c03312a4 |
14 | 33bbca4d2 |
15 | 1d443702a |
hex | 1200f4198 |
4832838040 has 32 divisors (see below), whose sum is σ = 10936756080. Its totient is φ = 1921958272.
The previous prime is 4832838007. The next prime is 4832838071. The reversal of 4832838040 is 408382384.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 4832837984 and 4832838002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 342274 + ... + 356113.
Almost surely, 24832838040 is an apocalyptic number.
4832838040 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4832838040 is an abundant number, since it is smaller than the sum of its proper divisors (6103918040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4832838040 is a wasteful number, since it uses less digits than its factorization.
4832838040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 698571 (or 698567 counting only the distinct ones).
The product of its (nonzero) digits is 147456, while the sum is 40.
The square root of 4832838040 is about 69518.6164994672. The cubic root of 4832838040 is about 1690.7033520654.
It can be divided in two parts, 48328 and 38040, that added together give a palindrome (86368).
The spelling of 4832838040 in words is "four billion, eight hundred thirty-two million, eight hundred thirty-eight thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •