Base | Representation |
---|---|
bin | 1001100101000111… |
… | …11100110101100001 |
3 | 111021102221021210201 |
4 | 10302203330311201 |
5 | 41013133033241 |
6 | 2210205425201 |
7 | 241311631504 |
oct | 46243746541 |
9 | 14242837721 |
10 | 5143252321 |
11 | 21aa260659 |
12 | bb656b201 |
13 | 63c73738c |
14 | 36b11113b |
15 | 201801931 |
hex | 1328fcd61 |
5143252321 has 2 divisors, whose sum is σ = 5143252322. Its totient is φ = 5143252320.
The previous prime is 5143252307. The next prime is 5143252337. The reversal of 5143252321 is 1232523415.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5132289600 + 10962721 = 71640^2 + 3311^2 .
It is a cyclic number.
It is not a de Polignac number, because 5143252321 - 27 = 5143252193 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5143252321.
It is not a weakly prime, because it can be changed into another prime (5143252351) 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, 2571626160 + 2571626161.
It is an arithmetic number, because the mean of its divisors is an integer number (2571626161).
Almost surely, 25143252321 is an apocalyptic number.
It is an amenable number.
5143252321 is a deficient number, since it is larger than the sum of its proper divisors (1).
5143252321 is an equidigital number, since it uses as much as digits as its factorization.
5143252321 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7200, while the sum is 28.
The square root of 5143252321 is about 71716.4717550996. The cubic root of 5143252321 is about 1726.1529583726.
Adding to 5143252321 its reverse (1232523415), we get a palindrome (6375775736).
The spelling of 5143252321 in words is "five billion, one hundred forty-three million, two hundred fifty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •