Base | Representation |
---|---|
bin | 101101100101111111… |
… | …001100011011010111 |
3 | 11200100210210111021000 |
4 | 231211333030123113 |
5 | 1300230130030142 |
6 | 34253454354343 |
7 | 3352111425024 |
oct | 554577143327 |
9 | 150323714230 |
10 | 48955705047 |
11 | 19842245877 |
12 | 95a31bb9b3 |
13 | 48025c4112 |
14 | 2525b7254b |
15 | 1417d6414c |
hex | b65fcc6d7 |
48955705047 has 16 divisors (see below), whose sum is σ = 72721427680. Its totient is φ = 32549630976.
The previous prime is 48955705013. The next prime is 48955705093. The reversal of 48955705047 is 74050755984.
48955705047 is a `hidden beast` number, since 4 + 89 + 5 + 57 + 0 + 504 + 7 = 666.
It is not a de Polignac number, because 48955705047 - 210 = 48955704023 is a prime.
It is a super-2 number, since 2×489557050472 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 48955704984 and 48955705002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48955705247) 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 15 ways as a sum of consecutive naturals, for example, 2420458 + ... + 2440599.
It is an arithmetic number, because the mean of its divisors is an integer number (4545089230).
Almost surely, 248955705047 is an apocalyptic number.
48955705047 is a deficient number, since it is larger than the sum of its proper divisors (23765722633).
48955705047 is a wasteful number, since it uses less digits than its factorization.
48955705047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4861439 (or 4861433 counting only the distinct ones).
The product of its (nonzero) digits is 7056000, while the sum is 54.
The spelling of 48955705047 in words is "forty-eight billion, nine hundred fifty-five million, seven hundred five thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •