Base | Representation |
---|---|
bin | 1011100100010… |
… | …0000010001001 |
3 | 10101021201112202 |
4 | 2321010002021 |
5 | 44404410121 |
6 | 4451445545 |
7 | 1126232534 |
oct | 271040211 |
9 | 111251482 |
10 | 48513161 |
11 | 25425724 |
12 | 142b68b5 |
13 | a087718 |
14 | 662ba1b |
15 | 43d440b |
hex | 2e44089 |
48513161 has 2 divisors, whose sum is σ = 48513162. Its totient is φ = 48513160.
The previous prime is 48513151. The next prime is 48513169. The reversal of 48513161 is 16131584.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 48511225 + 1936 = 6965^2 + 44^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-48513161 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (48513169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24256580 + 24256581.
It is an arithmetic number, because the mean of its divisors is an integer number (24256581).
Almost surely, 248513161 is an apocalyptic number.
It is an amenable number.
48513161 is a deficient number, since it is larger than the sum of its proper divisors (1).
48513161 is an equidigital number, since it uses as much as digits as its factorization.
48513161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2880, while the sum is 29.
The square root of 48513161 is about 6965.1389792308. The cubic root of 48513161 is about 364.7146352763.
The spelling of 48513161 in words is "forty-eight million, five hundred thirteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •