Base | Representation |
---|---|
bin | 1000010110001111… |
… | …00100001110011111 |
3 | 102120022201210100211 |
4 | 10023013210032133 |
5 | 33134231000223 |
6 | 2020410033251 |
7 | 216025056565 |
oct | 41307441637 |
9 | 12508653324 |
10 | 4481500063 |
11 | 199a765367 |
12 | a50a18827 |
13 | 5655ca0b1 |
14 | 307291a35 |
15 | 1b3686d0d |
hex | 10b1e439f |
4481500063 has 2 divisors, whose sum is σ = 4481500064. Its totient is φ = 4481500062.
The previous prime is 4481500013. The next prime is 4481500073. The reversal of 4481500063 is 3600051844.
It is a happy number.
4481500063 is digitally balanced in base 3, 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 a de Polignac number, because none of the positive numbers 2k-4481500063 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4481499998 and 4481500034.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4481500013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2240750031 + 2240750032.
It is an arithmetic number, because the mean of its divisors is an integer number (2240750032).
Almost surely, 24481500063 is an apocalyptic number.
4481500063 is a deficient number, since it is larger than the sum of its proper divisors (1).
4481500063 is an equidigital number, since it uses as much as digits as its factorization.
4481500063 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 31.
The square root of 4481500063 is about 66944.0069236971. The cubic root of 4481500063 is about 1648.6980930697.
The spelling of 4481500063 in words is "four billion, four hundred eighty-one million, five hundred thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •