Base | Representation |
---|---|
bin | 10110000111111010010001… |
… | …01100101111001010100011 |
3 | 20101020220222001022010200210 |
4 | 23003331020230233022203 |
5 | 22334041320421430432 |
6 | 251245351255345203 |
7 | 13150604066010222 |
oct | 1303751054571243 |
9 | 211226861263623 |
10 | 48650314248867 |
11 | 1455753409a761 |
12 | 555890b982203 |
13 | 211b921a053c6 |
14 | c0298b370cb9 |
15 | 59578dc6a8cc |
hex | 2c3f48b2f2a3 |
48650314248867 has 8 divisors (see below), whose sum is σ = 64956311370496. Its totient is φ = 32388929979912.
The previous prime is 48650314248793. The next prime is 48650314248917. The reversal of 48650314248867 is 76884241305684.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 48650314248867 - 214 = 48650314232483 is a prime.
It is a super-2 number, since 2×486503142488672 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 48650314248798 and 48650314248807.
It is not an unprimeable number, because it can be changed into a prime (48650316248867) 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, 11153210623 + ... + 11153214984.
It is an arithmetic number, because the mean of its divisors is an integer number (8119538921312).
Almost surely, 248650314248867 is an apocalyptic number.
48650314248867 is a deficient number, since it is larger than the sum of its proper divisors (16305997121629).
48650314248867 is a wasteful number, since it uses less digits than its factorization.
48650314248867 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22306426337.
The product of its (nonzero) digits is 247726080, while the sum is 66.
The spelling of 48650314248867 in words is "forty-eight trillion, six hundred fifty billion, three hundred fourteen million, two hundred forty-eight thousand, eight hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •