Base | Representation |
---|---|
bin | 1001100101001011… |
… | …01111110110110001 |
3 | 111021110211020001121 |
4 | 10302211233312301 |
5 | 41013243122231 |
6 | 2210223502241 |
7 | 241315633153 |
oct | 46245576661 |
9 | 14243736047 |
10 | 5143723441 |
11 | 21aa55260a |
12 | bb6757981 |
13 | 63c87094c |
14 | 36b1d4ad3 |
15 | 201896311 |
hex | 13296fdb1 |
5143723441 has 2 divisors, whose sum is σ = 5143723442. Its totient is φ = 5143723440.
The previous prime is 5143723433. The next prime is 5143723451. The reversal of 5143723441 is 1443273415.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4462774416 + 680949025 = 66804^2 + 26095^2 .
It is a cyclic number.
It is not a de Polignac number, because 5143723441 - 23 = 5143723433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5143723397 and 5143723406.
It is not a weakly prime, because it can be changed into another prime (5143723451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2571861720 + 2571861721.
It is an arithmetic number, because the mean of its divisors is an integer number (2571861721).
Almost surely, 25143723441 is an apocalyptic number.
It is an amenable number.
5143723441 is a deficient number, since it is larger than the sum of its proper divisors (1).
5143723441 is an equidigital number, since it uses as much as digits as its factorization.
5143723441 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 40320, while the sum is 34.
The square root of 5143723441 is about 71719.7562809579. The cubic root of 5143723441 is about 1726.2056617531.
Adding to 5143723441 its reverse (1443273415), we get a palindrome (6586996856).
The spelling of 5143723441 in words is "five billion, one hundred forty-three million, seven hundred twenty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •