Base | Representation |
---|---|
bin | 101101100110011101… |
… | …100001000110101001 |
3 | 11200101100202100020210 |
4 | 231212131201012221 |
5 | 1300234143412212 |
6 | 34254341011333 |
7 | 3352236123003 |
oct | 554635410651 |
9 | 150340670223 |
10 | 48963654057 |
11 | 19846784aaa |
12 | 95a59b3b49 |
13 | 4804148286 |
14 | 2526c41373 |
15 | 14188d453c |
hex | b667611a9 |
48963654057 has 8 divisors (see below), whose sum is σ = 65294346240. Its totient is φ = 32637698960.
The previous prime is 48963654043. The next prime is 48963654067. The reversal of 48963654057 is 75045636984.
48963654057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 48963654057 - 212 = 48963649961 is a prime.
It is a super-2 number, since 2×489636540572 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 48963653988 and 48963654006.
It is not an unprimeable number, because it can be changed into a prime (48963654067) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1160082 + ... + 1201547.
It is an arithmetic number, because the mean of its divisors is an integer number (8161793280).
Almost surely, 248963654057 is an apocalyptic number.
It is an amenable number.
48963654057 is a deficient number, since it is larger than the sum of its proper divisors (16330692183).
48963654057 is a wasteful number, since it uses less digits than its factorization.
48963654057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2368543.
The product of its (nonzero) digits is 21772800, while the sum is 57.
The spelling of 48963654057 in words is "forty-eight billion, nine hundred sixty-three million, six hundred fifty-four thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •