Base | Representation |
---|---|
bin | 10110000111101101100000… |
… | …01100010100001111101110 |
3 | 20101020021021102001000211202 |
4 | 23003312300030110033232 |
5 | 22333433301411131440 |
6 | 251242255231045502 |
7 | 13150242205233326 |
oct | 1303666014241756 |
9 | 211207242030752 |
10 | 48643460645870 |
11 | 14554637447352 |
12 | 5557518670892 |
13 | 211b09bb3940c |
14 | c024db042286 |
15 | 5954dc21d615 |
hex | 2c3db03143ee |
48643460645870 has 16 divisors (see below), whose sum is σ = 87577477041600. Its totient is φ = 19453106951904.
The previous prime is 48643460645837. The next prime is 48643460645873. The reversal of 48643460645870 is 7854606434684.
It is a happy number.
48643460645870 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 48643460645797 and 48643460645806.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48643460645873) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 534615542 + ... + 534706521.
It is an arithmetic number, because the mean of its divisors is an integer number (5473592315100).
Almost surely, 248643460645870 is an apocalyptic number.
48643460645870 is a deficient number, since it is larger than the sum of its proper divisors (38934016395730).
48643460645870 is a wasteful number, since it uses less digits than its factorization.
48643460645870 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1069326619.
The product of its (nonzero) digits is 371589120, while the sum is 65.
The spelling of 48643460645870 in words is "forty-eight trillion, six hundred forty-three billion, four hundred sixty million, six hundred forty-five thousand, eight hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •