Base | Representation |
---|---|
bin | 101100110011101100… |
… | …110000101001010101 |
3 | 11121012000020102210020 |
4 | 230303230300221111 |
5 | 1242013133334421 |
6 | 34034035215353 |
7 | 3322155232104 |
oct | 546354605125 |
9 | 147160212706 |
10 | 48112011861 |
11 | 19449a81681 |
12 | 93a8747559 |
13 | 46c9883694 |
14 | 2485ab203b |
15 | 13b8c5adc6 |
hex | b33b30a55 |
48112011861 has 4 divisors (see below), whose sum is σ = 64149349152. Its totient is φ = 32074674572.
The previous prime is 48112011841. The next prime is 48112011881. The reversal of 48112011861 is 16811021184.
48112011861 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (48112011841) and next prime (48112011881).
It is a cyclic number.
It is not a de Polignac number, because 48112011861 - 27 = 48112011733 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48112011841) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8018668641 + ... + 8018668646.
It is an arithmetic number, because the mean of its divisors is an integer number (16037337288).
Almost surely, 248112011861 is an apocalyptic number.
It is an amenable number.
48112011861 is a deficient number, since it is larger than the sum of its proper divisors (16037337291).
48112011861 is a wasteful number, since it uses less digits than its factorization.
48112011861 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16037337290.
The product of its (nonzero) digits is 3072, while the sum is 33.
The spelling of 48112011861 in words is "forty-eight billion, one hundred twelve million, eleven thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •