Base | Representation |
---|---|
bin | 101100111110100110… |
… | …011010010111100001 |
3 | 11121122202100222012101 |
4 | 230332212122113201 |
5 | 1242401443201441 |
6 | 34104131130401 |
7 | 3326535565222 |
oct | 547646322741 |
9 | 147582328171 |
10 | 48294897121 |
11 | 19533235019 |
12 | 9439a43a01 |
13 | 4728727903 |
14 | 24a20bb249 |
15 | 13c9d34231 |
hex | b3e99a5e1 |
48294897121 has 3 divisors (see below), whose sum is σ = 48295116883. Its totient is φ = 48294677360.
The previous prime is 48294897113. The next prime is 48294897127. The reversal of 48294897121 is 12179849284.
The square root of 48294897121 is 219761.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in only one way, i.e., 1136431521 + 47158465600 = 33711^2 + 217160^2 .
It is not a de Polignac number, because 48294897121 - 23 = 48294897113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48294897127) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 109881 + ... + 329641.
Almost surely, 248294897121 is an apocalyptic number.
48294897121 is the 219761-st square number.
48294897121 is the 109881-st centered octagonal number.
It is an amenable number.
48294897121 is a deficient number, since it is larger than the sum of its proper divisors (219762).
48294897121 is an frugal number, since it uses more digits than its factorization.
48294897121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 439522 (or 219761 counting only the distinct ones).
The product of its digits is 2322432, while the sum is 55.
The spelling of 48294897121 in words is "forty-eight billion, two hundred ninety-four million, eight hundred ninety-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •