Base | Representation |
---|---|
bin | 10110001000101011001001… |
… | …10011011011001000101000 |
3 | 20101100102200211222020202200 |
4 | 23010111210303123020220 |
5 | 22340004041211131111 |
6 | 251305411222100200 |
7 | 13152523265356632 |
oct | 1304254463331050 |
9 | 211312624866680 |
10 | 48676555567656 |
11 | 1456767a693985 |
12 | 5561a13b7a660 |
13 | 212124446bc83 |
14 | c03d5a521a52 |
15 | 5962c78db256 |
hex | 2c4564cdb228 |
48676555567656 has 48 divisors (see below), whose sum is σ = 132672034446900. Its totient is φ = 16122171267072.
The previous prime is 48676555567637. The next prime is 48676555567657. The reversal of 48676555567656 is 65676555567684.
48676555567656 is a `hidden beast` number, since 4 + 8 + 6 + 7 + 6 + 5 + 5 + 556 + 7 + 6 + 56 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 48668287302756 + 8268264900 = 6976266^2 + 90930^2 .
It is a super-2 number, since 2×486765555676562 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (48676555567657) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2153056441 + ... + 2153079048.
Almost surely, 248676555567656 is an apocalyptic number.
It is an amenable number.
48676555567656 is an abundant number, since it is smaller than the sum of its proper divisors (83995478879244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48676555567656 is a wasteful number, since it uses less digits than its factorization.
48676555567656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4306135658 (or 4306135651 counting only the distinct ones).
The product of its digits is 38102400000, while the sum is 81.
The spelling of 48676555567656 in words is "forty-eight trillion, six hundred seventy-six billion, five hundred fifty-five million, five hundred sixty-seven thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •