Base | Representation |
---|---|
bin | 1011100110100… |
… | …0110010010101 |
3 | 10101120101001022 |
4 | 2321220302111 |
5 | 44424214301 |
6 | 4455010525 |
7 | 1130430452 |
oct | 271506225 |
9 | 111511038 |
10 | 48663701 |
11 | 25518839 |
12 | 14369a45 |
13 | a10b0b8 |
14 | 666a829 |
15 | 4413d1b |
hex | 2e68c95 |
48663701 has 2 divisors, whose sum is σ = 48663702. Its totient is φ = 48663700.
The previous prime is 48663697. The next prime is 48663709. The reversal of 48663701 is 10736684.
48663701 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48302500 + 361201 = 6950^2 + 601^2 .
It is a cyclic number.
It is not a de Polignac number, because 48663701 - 22 = 48663697 is a prime.
It is a Chen prime.
It is equal to p2925584 and since 48663701 and 2925584 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48663709) 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, 24331850 + 24331851.
It is an arithmetic number, because the mean of its divisors is an integer number (24331851).
Almost surely, 248663701 is an apocalyptic number.
It is an amenable number.
48663701 is a deficient number, since it is larger than the sum of its proper divisors (1).
48663701 is an equidigital number, since it uses as much as digits as its factorization.
48663701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24192, while the sum is 35.
The square root of 48663701 is about 6975.9372846952. The cubic root of 48663701 is about 365.0914914201.
The spelling of 48663701 in words is "forty-eight million, six hundred sixty-three thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •