Base | Representation |
---|---|
bin | 1001000100101110… |
… | …01000010100110100 |
3 | 110120111111121102020 |
4 | 10202113020110310 |
5 | 34434043043202 |
6 | 2123220113140 |
7 | 231501456531 |
oct | 44227102464 |
9 | 13514447366 |
10 | 4871456052 |
11 | 207a8a0041 |
12 | b3b5357b0 |
13 | 5c8332a98 |
14 | 342d9dd88 |
15 | 1d7a145bc |
hex | 1225c8534 |
4871456052 has 12 divisors (see below), whose sum is σ = 11366730816. Its totient is φ = 1623818680.
The previous prime is 4871456021. The next prime is 4871456059. The reversal of 4871456052 is 2506541784.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 4871455995 and 4871456013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4871456059) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 202977324 + ... + 202977347.
It is an arithmetic number, because the mean of its divisors is an integer number (947227568).
Almost surely, 24871456052 is an apocalyptic number.
It is an amenable number.
4871456052 is an abundant number, since it is smaller than the sum of its proper divisors (6495274764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4871456052 is a wasteful number, since it uses less digits than its factorization.
4871456052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 405954678 (or 405954676 counting only the distinct ones).
The product of its (nonzero) digits is 268800, while the sum is 42.
The square root of 4871456052 is about 69795.8168660558. The cubic root of 4871456052 is about 1695.1947406363.
The spelling of 4871456052 in words is "four billion, eight hundred seventy-one million, four hundred fifty-six thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.154 sec. • engine limits •