Base | Representation |
---|---|
bin | 101101100101110111… |
… | …001100111101111001 |
3 | 11200100122212001112120 |
4 | 231211313030331321 |
5 | 1300224111010410 |
6 | 34253341431453 |
7 | 3352054551231 |
oct | 554567147571 |
9 | 150318761476 |
10 | 48953610105 |
11 | 19841044914 |
12 | 95a256b589 |
13 | 480203c6ca |
14 | 2525788cc1 |
15 | 1417a9d570 |
hex | b65dccf79 |
48953610105 has 16 divisors (see below), whose sum is σ = 82448185920. Its totient is φ = 24734455488.
The previous prime is 48953610047. The next prime is 48953610161. The reversal of 48953610105 is 50101635984.
It is a de Polignac number, because none of the positive numbers 2k-48953610105 is a prime.
It is a super-2 number, since 2×489536101052 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 85883242 + ... + 85883811.
It is an arithmetic number, because the mean of its divisors is an integer number (5153011620).
Almost surely, 248953610105 is an apocalyptic number.
It is an amenable number.
48953610105 is a deficient number, since it is larger than the sum of its proper divisors (33494575815).
48953610105 is a wasteful number, since it uses less digits than its factorization.
48953610105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171767080.
The product of its (nonzero) digits is 129600, while the sum is 42.
The spelling of 48953610105 in words is "forty-eight billion, nine hundred fifty-three million, six hundred ten thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •