Base | Representation |
---|---|
bin | 1001011011101010… |
… | …00010010100010101 |
3 | 111001220111222122001 |
4 | 10231311002110111 |
5 | 40332321021031 |
6 | 2154251435301 |
7 | 236325654625 |
oct | 45565022425 |
9 | 14056458561 |
10 | 5063845141 |
11 | 2169454893 |
12 | b93a55b31 |
13 | 629153a94 |
14 | 360760885 |
15 | 1e9868861 |
hex | 12dd42515 |
5063845141 has 2 divisors, whose sum is σ = 5063845142. Its totient is φ = 5063845140.
The previous prime is 5063845103. The next prime is 5063845159. The reversal of 5063845141 is 1415483605.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4296278116 + 767567025 = 65546^2 + 27705^2 .
It is a cyclic number.
It is not a de Polignac number, because 5063845141 - 29 = 5063844629 is a prime.
It is a super-2 number, since 2×50638451412 = 51285055224058619762, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5063845141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5063845441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2531922570 + 2531922571.
It is an arithmetic number, because the mean of its divisors is an integer number (2531922571).
Almost surely, 25063845141 is an apocalyptic number.
It is an amenable number.
5063845141 is a deficient number, since it is larger than the sum of its proper divisors (1).
5063845141 is an equidigital number, since it uses as much as digits as its factorization.
5063845141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 57600, while the sum is 37.
The square root of 5063845141 is about 71160.6994133700. The cubic root of 5063845141 is about 1717.2234295784.
The spelling of 5063845141 in words is "five billion, sixty-three million, eight hundred forty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •