Base | Representation |
---|---|
bin | 1011100000001… |
… | …0110111001110 |
3 | 10100210011101010 |
4 | 2320002313032 |
5 | 44322334342 |
6 | 4442030050 |
7 | 1124041353 |
oct | 270026716 |
9 | 110704333 |
10 | 48246222 |
11 | 25263112 |
12 | 141a8326 |
13 | 9cc307b |
14 | 659c62a |
15 | 438029c |
hex | 2e02dce |
48246222 has 8 divisors (see below), whose sum is σ = 96492456. Its totient is φ = 16082072.
The previous prime is 48246173. The next prime is 48246223. The reversal of 48246222 is 22264284.
48246222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
48246222 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 48246222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48246223) 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, 4020513 + ... + 4020524.
It is an arithmetic number, because the mean of its divisors is an integer number (12061557).
Almost surely, 248246222 is an apocalyptic number.
48246222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48246222 is a wasteful number, since it uses less digits than its factorization.
48246222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8041042.
The product of its digits is 12288, while the sum is 30.
The square root of 48246222 is about 6945.9500430107. The cubic root of 48246222 is about 364.0444688657.
The spelling of 48246222 in words is "forty-eight million, two hundred forty-six thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •