Base | Representation |
---|---|
bin | 1001000010100001… |
… | …10011010110000000 |
3 | 110112012210221221200 |
4 | 10201100303112000 |
5 | 34414333120112 |
6 | 2121321021200 |
7 | 231155663310 |
oct | 44120632600 |
9 | 13465727850 |
10 | 4853020032 |
11 | 2070448863 |
12 | b35324800 |
13 | 5c45794b3 |
14 | 340761440 |
15 | 1d60c1cdc |
hex | 121433580 |
4853020032 has 96 divisors (see below), whose sum is σ = 15960107280. Its totient is φ = 1386574848.
The previous prime is 4853020019. The next prime is 4853020037. The reversal of 4853020032 is 2300203584.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 4853019978 and 4853020005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4853020037) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 292843 + ... + 308970.
Almost surely, 24853020032 is an apocalyptic number.
4853020032 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
4853020032 is an abundant number, since it is smaller than the sum of its proper divisors (11107087248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4853020032 is a wasteful number, since it uses less digits than its factorization.
4853020032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 601840 (or 601825 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 4853020032 is about 69663.6205777449. The cubic root of 4853020032 is about 1693.0535497132.
The spelling of 4853020032 in words is "four billion, eight hundred fifty-three million, twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •