Base | Representation |
---|---|
bin | 1011101011000… |
… | …0001011110111 |
3 | 10102010020012210 |
4 | 2322300023313 |
5 | 100013044101 |
6 | 4505144503 |
7 | 1133056206 |
oct | 272601367 |
9 | 112106183 |
10 | 48956151 |
11 | 256a8532 |
12 | 1448b133 |
13 | a1b124a |
14 | 670523d |
15 | 44707d6 |
hex | 2eb02f7 |
48956151 has 8 divisors (see below), whose sum is σ = 65874160. Its totient is φ = 32337792.
The previous prime is 48956123. The next prime is 48956183. The reversal of 48956151 is 15165984.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 48956151 - 25 = 48956119 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48956051) 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, 74530 + ... + 75183.
It is an arithmetic number, because the mean of its divisors is an integer number (8234270).
Almost surely, 248956151 is an apocalyptic number.
48956151 is a deficient number, since it is larger than the sum of its proper divisors (16918009).
48956151 is a wasteful number, since it uses less digits than its factorization.
48956151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149825.
The product of its digits is 43200, while the sum is 39.
The square root of 48956151 is about 6996.8672275526. The cubic root of 48956151 is about 365.8213840751.
The spelling of 48956151 in words is "forty-eight million, nine hundred fifty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •