Base | Representation |
---|---|
bin | 1011100100011… |
… | …0011100100011 |
3 | 10101022020002202 |
4 | 2321012130203 |
5 | 44410214133 |
6 | 4452003415 |
7 | 1126303412 |
oct | 271063443 |
9 | 111266082 |
10 | 48523043 |
11 | 25432098 |
12 | 1430056b |
13 | a08c07a |
14 | 6631479 |
15 | 43d72e8 |
hex | 2e46723 |
48523043 has 2 divisors, whose sum is σ = 48523044. Its totient is φ = 48523042.
The previous prime is 48522997. The next prime is 48523051. The reversal of 48523043 is 34032584.
48523043 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 48523043 - 212 = 48518947 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 48522997 and 48523015.
It is not a weakly prime, because it can be changed into another prime (48523063) 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 as a sum of consecutive naturals, namely, 24261521 + 24261522.
It is an arithmetic number, because the mean of its divisors is an integer number (24261522).
Almost surely, 248523043 is an apocalyptic number.
48523043 is a deficient number, since it is larger than the sum of its proper divisors (1).
48523043 is an equidigital number, since it uses as much as digits as its factorization.
48523043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 29.
The square root of 48523043 is about 6965.8483331178. The cubic root of 48523043 is about 364.7393973908.
The spelling of 48523043 in words is "forty-eight million, five hundred twenty-three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •