Base | Representation |
---|---|
bin | 1011100100111… |
… | …1001110100101 |
3 | 10101101001102222 |
4 | 2321033032211 |
5 | 44412342023 |
6 | 4452442125 |
7 | 1126513316 |
oct | 271171645 |
9 | 111331388 |
10 | 48559013 |
11 | 25457118 |
12 | 14319345 |
13 | a0a2559 |
14 | 664060d |
15 | 43e2cc8 |
hex | 2e4f3a5 |
48559013 has 2 divisors, whose sum is σ = 48559014. Its totient is φ = 48559012.
The previous prime is 48558973. The next prime is 48559031. The reversal of 48559013 is 31095584.
Together with next prime (48559031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41499364 + 7059649 = 6442^2 + 2657^2 .
It is a cyclic number.
It is not a de Polignac number, because 48559013 - 222 = 44364709 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48553013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24279506 + 24279507.
It is an arithmetic number, because the mean of its divisors is an integer number (24279507).
Almost surely, 248559013 is an apocalyptic number.
It is an amenable number.
48559013 is a deficient number, since it is larger than the sum of its proper divisors (1).
48559013 is an equidigital number, since it uses as much as digits as its factorization.
48559013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 35.
The square root of 48559013 is about 6968.4297370355. The cubic root of 48559013 is about 364.8295019047.
The spelling of 48559013 in words is "forty-eight million, five hundred fifty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •