Base | Representation |
---|---|
bin | 10101110111101101011001… |
… | …01111010110010011111111 |
3 | 20022021201002221111011200210 |
4 | 22323312230233112103333 |
5 | 22300431242102002443 |
6 | 250141525534323503 |
7 | 13062436255453323 |
oct | 1273665457262377 |
9 | 208251087434623 |
10 | 48093646906623 |
11 | 1436244597530a |
12 | 5488a55059593 |
13 | 20ab2997053b6 |
14 | bc3a60135983 |
15 | 58605d288c33 |
hex | 2bbdacbd64ff |
48093646906623 has 8 divisors (see below), whose sum is σ = 64124897787136. Its totient is φ = 32062413648600.
The previous prime is 48093646906619. The next prime is 48093646906633. The reversal of 48093646906623 is 32660964639084.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 48093646906623 - 22 = 48093646906619 is a prime.
It is a super-3 number, since 3×480936469066233 (a number of 42 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48093646906633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4581018 + ... + 10824648.
It is an arithmetic number, because the mean of its divisors is an integer number (8015612223392).
Almost surely, 248093646906623 is an apocalyptic number.
48093646906623 is a deficient number, since it is larger than the sum of its proper divisors (16031250880513).
48093646906623 is a wasteful number, since it uses less digits than its factorization.
48093646906623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8811245.
The product of its (nonzero) digits is 241864704, while the sum is 66.
The spelling of 48093646906623 in words is "forty-eight trillion, ninety-three billion, six hundred forty-six million, nine hundred six thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •