Base | Representation |
---|---|
bin | 1001100001011110… |
… | …01011011110100001 |
3 | 111012022100002120102 |
4 | 10300233023132201 |
5 | 40432314011231 |
6 | 2203153352145 |
7 | 240460510115 |
oct | 46057133641 |
9 | 14168302512 |
10 | 5112641441 |
11 | 2193a53206 |
12 | ba8268655 |
13 | 6362aa32b |
14 | 367023745 |
15 | 1edca6acb |
hex | 130bcb7a1 |
5112641441 has 2 divisors, whose sum is σ = 5112641442. Its totient is φ = 5112641440.
The previous prime is 5112641383. The next prime is 5112641453. The reversal of 5112641441 is 1441462115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2632203025 + 2480438416 = 51305^2 + 49804^2 .
It is a cyclic number.
It is not a de Polignac number, because 5112641441 - 26 = 5112641377 is a prime.
It is a super-2 number, since 2×51126414412 = 52278205008461112962, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5112641461) 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, 2556320720 + 2556320721.
It is an arithmetic number, because the mean of its divisors is an integer number (2556320721).
Almost surely, 25112641441 is an apocalyptic number.
It is an amenable number.
5112641441 is a deficient number, since it is larger than the sum of its proper divisors (1).
5112641441 is an equidigital number, since it uses as much as digits as its factorization.
5112641441 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3840, while the sum is 29.
The square root of 5112641441 is about 71502.7372972532. The cubic root of 5112641441 is about 1722.7216512002.
The spelling of 5112641441 in words is "five billion, one hundred twelve million, six hundred forty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •