Base | Representation |
---|---|
bin | 10110001111011000001101… |
… | …11101010001110100100100 |
3 | 20102011110021121012122201100 |
4 | 23013230012331101310210 |
5 | 22402242322241423003 |
6 | 252003305102400100 |
7 | 13205256543124023 |
oct | 1307540675216444 |
9 | 212143247178640 |
10 | 48906909326628 |
11 | 146463383504a1 |
12 | 559a5a0b90030 |
13 | 2139b95224372 |
14 | c1116da168ba |
15 | 59c2aaa66ba3 |
hex | 2c7b06f51d24 |
48906909326628 has 72 divisors (see below), whose sum is σ = 124326967171680. Its totient is φ = 16209856736640.
The previous prime is 48906909326617. The next prime is 48906909326651. The reversal of 48906909326628 is 82662390960984.
48906909326628 is a `hidden beast` number, since 489 + 0 + 6 + 90 + 9 + 32 + 6 + 6 + 28 = 666.
48906909326628 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 77277051 + ... + 77907357.
It is an arithmetic number, because the mean of its divisors is an integer number (1726763432940).
Almost surely, 248906909326628 is an apocalyptic number.
It is an amenable number.
48906909326628 is an abundant number, since it is smaller than the sum of its proper divisors (75420057845052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48906909326628 is a wasteful number, since it uses less digits than its factorization.
48906909326628 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 642537 (or 642532 counting only the distinct ones).
The product of its (nonzero) digits is 483729408, while the sum is 72.
The spelling of 48906909326628 in words is "forty-eight trillion, nine hundred six billion, nine hundred nine million, three hundred twenty-six thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •