Base | Representation |
---|---|
bin | 10101110110100010010011… |
… | …00101110110010010000001 |
3 | 20022010212001002210102102021 |
4 | 22323101021211312102001 |
5 | 22244301204131003311 |
6 | 250111221112521441 |
7 | 13056511166100142 |
oct | 1273211145662201 |
9 | 208125032712367 |
10 | 48053328766081 |
11 | 14347336382601 |
12 | 54810826b0281 |
13 | 20a75427730c2 |
14 | bc1b175d1ac9 |
15 | 584e9d8ad171 |
hex | 2bb449976481 |
48053328766081 has 4 divisors (see below), whose sum is σ = 49603436145664. Its totient is φ = 46503221386500.
The previous prime is 48053328766057. The next prime is 48053328766097. The reversal of 48053328766081 is 18066782335084.
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 a cyclic number.
It is not a de Polignac number, because 48053328766081 - 211 = 48053328764033 is a prime.
It is a super-2 number, since 2×480533287660812 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48053328766031) 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, 775053689745 + ... + 775053689806.
It is an arithmetic number, because the mean of its divisors is an integer number (12400859036416).
Almost surely, 248053328766081 is an apocalyptic number.
It is an amenable number.
48053328766081 is a deficient number, since it is larger than the sum of its proper divisors (1550107379583).
48053328766081 is a wasteful number, since it uses less digits than its factorization.
48053328766081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1550107379582.
The product of its (nonzero) digits is 46448640, while the sum is 61.
The spelling of 48053328766081 in words is "forty-eight trillion, fifty-three billion, three hundred twenty-eight million, seven hundred sixty-six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •