Base | Representation |
---|---|
bin | 1011100110001… |
… | …1110000100011 |
3 | 10101112022210120 |
4 | 2321203300203 |
5 | 44423034412 |
6 | 4454331323 |
7 | 1130313432 |
oct | 271436043 |
9 | 111468716 |
10 | 48643107 |
11 | 25504317 |
12 | 14359b43 |
13 | a101906 |
14 | 6663119 |
15 | 440cb8c |
hex | 2e63c23 |
48643107 has 4 divisors (see below), whose sum is σ = 64857480. Its totient is φ = 32428736.
The previous prime is 48643099. The next prime is 48643193. The reversal of 48643107 is 70134684.
48643107 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.
It is a cyclic number.
It is not a de Polignac number, because 48643107 - 23 = 48643099 is a prime.
It is a super-2 number, since 2×486431072 = 4732303717226898, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (48643607) 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, 8107182 + ... + 8107187.
It is an arithmetic number, because the mean of its divisors is an integer number (16214370).
Almost surely, 248643107 is an apocalyptic number.
48643107 is a deficient number, since it is larger than the sum of its proper divisors (16214373).
48643107 is a wasteful number, since it uses less digits than its factorization.
48643107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16214372.
The product of its (nonzero) digits is 16128, while the sum is 33.
The square root of 48643107 is about 6974.4610544471. The cubic root of 48643107 is about 365.0399831098.
It can be divided in two parts, 48 and 643107, that multiplied together give a square (30869136 = 55562).
The spelling of 48643107 in words is "forty-eight million, six hundred forty-three thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •