Base | Representation |
---|---|
bin | 101101010111000010… |
… | …110000001011010110 |
3 | 11122201100000022200221 |
4 | 231113002300023112 |
5 | 1244221433322140 |
6 | 34212540424554 |
7 | 3342645332164 |
oct | 552702601326 |
9 | 148640008627 |
10 | 48704979670 |
11 | 19723767116 |
12 | 953324815a |
13 | 47926894c9 |
14 | 2500748234 |
15 | 1400d3a14a |
hex | b570b02d6 |
48704979670 has 64 divisors (see below), whose sum is σ = 90489830400. Its totient is φ = 18866165760.
The previous prime is 48704979667. The next prime is 48704979671. The reversal of 48704979670 is 7697940784.
It is a super-2 number, since 2×487049796702 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 48704979599 and 48704979608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48704979671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26893065 + ... + 26894875.
It is an arithmetic number, because the mean of its divisors is an integer number (1413903600).
Almost surely, 248704979670 is an apocalyptic number.
48704979670 is a deficient number, since it is larger than the sum of its proper divisors (41784850730).
48704979670 is a wasteful number, since it uses less digits than its factorization.
48704979670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2533.
The product of its (nonzero) digits is 21337344, while the sum is 61.
The spelling of 48704979670 in words is "forty-eight billion, seven hundred four million, nine hundred seventy-nine thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •