Base | Representation |
---|---|
bin | 1011101011000… |
… | …0001100110101 |
3 | 10102010020022002 |
4 | 2322300030311 |
5 | 100013044323 |
6 | 4505145045 |
7 | 1133056325 |
oct | 272601465 |
9 | 112106262 |
10 | 48956213 |
11 | 256a8589 |
12 | 1448b185 |
13 | a1b1297 |
14 | 6705285 |
15 | 4470828 |
hex | 2eb0335 |
48956213 has 4 divisors (see below), whose sum is σ = 51084768. Its totient is φ = 46827660.
The previous prime is 48956207. The next prime is 48956227. The reversal of 48956213 is 31265984.
It is a happy number.
48956213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 48956213 - 24 = 48956197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48956203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1064243 + ... + 1064288.
It is an arithmetic number, because the mean of its divisors is an integer number (12771192).
Almost surely, 248956213 is an apocalyptic number.
It is an amenable number.
48956213 is a deficient number, since it is larger than the sum of its proper divisors (2128555).
48956213 is a wasteful number, since it uses less digits than its factorization.
48956213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2128554.
The product of its digits is 51840, while the sum is 38.
The square root of 48956213 is about 6996.8716581055. The cubic root of 48956213 is about 365.8215385052.
The spelling of 48956213 in words is "forty-eight million, nine hundred fifty-six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •