Base | Representation |
---|---|
bin | 10110001000110010100000… |
… | …11011000000000101111000 |
3 | 20101100210220100021111210200 |
4 | 23010121100123000011320 |
5 | 22340040140144312113 |
6 | 251311303353042200 |
7 | 13153023245446524 |
oct | 1304312033000570 |
9 | 211323810244720 |
10 | 48680508588408 |
11 | 14569318aaa984 |
12 | 55627379b6360 |
13 | 21217244221c8 |
14 | c04213526d84 |
15 | 596459981873 |
hex | 2c46506c0178 |
48680508588408 has 48 divisors (see below), whose sum is σ = 131950847311920. Its totient is φ = 16213568107776.
The previous prime is 48680508588391. The next prime is 48680508588431. The reversal of 48680508588408 is 80488580508684.
48680508588408 is a `hidden beast` number, since 4 + 8 + 68 + 0 + 5 + 0 + 85 + 88 + 408 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 276329841 + ... + 276505952.
It is an arithmetic number, because the mean of its divisors is an integer number (2748975985665).
Almost surely, 248680508588408 is an apocalyptic number.
It is an amenable number.
48680508588408 is an abundant number, since it is smaller than the sum of its proper divisors (83270338723512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48680508588408 is a wasteful number, since it uses less digits than its factorization.
48680508588408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552837028 (or 552837021 counting only the distinct ones).
The product of its (nonzero) digits is 629145600, while the sum is 72.
The spelling of 48680508588408 in words is "forty-eight trillion, six hundred eighty billion, five hundred eight million, five hundred eighty-eight thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •