Base | Representation |
---|---|
bin | 101101010010010011… |
… | …100001001110100011 |
3 | 11122111210102202201202 |
4 | 231102103201032203 |
5 | 1244041111120203 |
6 | 34201020551415 |
7 | 3340661556323 |
oct | 552223411643 |
9 | 148453382652 |
10 | 48625488803 |
11 | 19692903491 |
12 | 95106b256b |
13 | 477c076aa8 |
14 | 24d3d75283 |
15 | 13e8d87388 |
hex | b524e13a3 |
48625488803 has 8 divisors (see below), whose sum is σ = 50269270128. Its totient is φ = 47005023744.
The previous prime is 48625488799. The next prime is 48625488811. The reversal of 48625488803 is 30888452684.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 48625488803 - 22 = 48625488799 is a prime.
It is a super-2 number, since 2×486254888032 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48625488833) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5824826 + ... + 5833167.
It is an arithmetic number, because the mean of its divisors is an integer number (6283658766).
Almost surely, 248625488803 is an apocalyptic number.
48625488803 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
48625488803 is a deficient number, since it is larger than the sum of its proper divisors (1643781325).
48625488803 is a wasteful number, since it uses less digits than its factorization.
48625488803 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11658133.
The product of its (nonzero) digits is 11796480, while the sum is 56.
The spelling of 48625488803 in words is "forty-eight billion, six hundred twenty-five million, four hundred eighty-eight thousand, eight hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •