Base | Representation |
---|---|
bin | 1001000011000000… |
… | …01111101011010000 |
3 | 110112111102122001022 |
4 | 10201200033223100 |
5 | 34421402140430 |
6 | 2121543455012 |
7 | 231235253543 |
oct | 44140175320 |
9 | 13474378038 |
10 | 4857068240 |
11 | 2072763292 |
12 | b36757468 |
13 | 5c5365c9b |
14 | 3410d685a |
15 | 1d66214e5 |
hex | 12180fad0 |
4857068240 has 40 divisors (see below), whose sum is σ = 11783674368. Its totient is φ = 1858355840.
The previous prime is 4857068233. The next prime is 4857068297. The reversal of 4857068240 is 428607584.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×48570682402 = 47182223776033395200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4857068191 and 4857068200.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1318016 + ... + 1321695.
Almost surely, 24857068240 is an apocalyptic number.
4857068240 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4857068240 is an abundant number, since it is smaller than the sum of its proper divisors (6926606128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4857068240 is a wasteful number, since it uses less digits than its factorization.
4857068240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2639747 (or 2639741 counting only the distinct ones).
The product of its (nonzero) digits is 430080, while the sum is 44.
The square root of 4857068240 is about 69692.6699158527. The cubic root of 4857068240 is about 1693.5241795495.
The spelling of 4857068240 in words is "four billion, eight hundred fifty-seven million, sixty-eight thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •