Base | Representation |
---|---|
bin | 1011100100001… |
… | …0011001001001 |
3 | 10101021101022212 |
4 | 2321002121021 |
5 | 44404201231 |
6 | 4451354505 |
7 | 1126204124 |
oct | 271023111 |
9 | 111241285 |
10 | 48506441 |
11 | 25420675 |
12 | 142b2a35 |
13 | a084649 |
14 | 66293bb |
15 | 43d242b |
hex | 2e42649 |
48506441 has 2 divisors, whose sum is σ = 48506442. Its totient is φ = 48506440.
The previous prime is 48506431. The next prime is 48506453. The reversal of 48506441 is 14460584.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 45630025 + 2876416 = 6755^2 + 1696^2 .
It is a cyclic number.
It is not a de Polignac number, because 48506441 - 26 = 48506377 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 48506398 and 48506407.
It is not a weakly prime, because it can be changed into another prime (48506401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24253220 + 24253221.
It is an arithmetic number, because the mean of its divisors is an integer number (24253221).
Almost surely, 248506441 is an apocalyptic number.
It is an amenable number.
48506441 is a deficient number, since it is larger than the sum of its proper divisors (1).
48506441 is an equidigital number, since it uses as much as digits as its factorization.
48506441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15360, while the sum is 32.
The square root of 48506441 is about 6964.6565600897. The cubic root of 48506441 is about 364.6977945162.
The spelling of 48506441 in words is "forty-eight million, five hundred six thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •