Base | Representation |
---|---|
bin | 1001100101001001… |
… | …00111000110010111 |
3 | 111021110021002021012 |
4 | 10302210213012113 |
5 | 41013204103211 |
6 | 2210213242435 |
7 | 241313252264 |
oct | 46244470627 |
9 | 14243232235 |
10 | 5143425431 |
11 | 21aa369721 |
12 | bb663341b |
13 | 63c798101 |
14 | 36b15826b |
15 | 201837d8b |
hex | 132927197 |
5143425431 has 4 divisors (see below), whose sum is σ = 5143569000. Its totient is φ = 5143281864.
The previous prime is 5143425403. The next prime is 5143425437. The reversal of 5143425431 is 1345243415.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 5143425431 - 26 = 5143425367 is a prime.
It is a super-2 number, since 2×51434254312 = 52909650328515071522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5143425437) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31265 + ... + 106133.
It is an arithmetic number, because the mean of its divisors is an integer number (1285892250).
Almost surely, 25143425431 is an apocalyptic number.
5143425431 is a deficient number, since it is larger than the sum of its proper divisors (143569).
5143425431 is an equidigital number, since it uses as much as digits as its factorization.
5143425431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143568.
The product of its digits is 28800, while the sum is 32.
The square root of 5143425431 is about 71717.6786503858. The cubic root of 5143425431 is about 1726.1723242633.
Adding to 5143425431 its reverse (1345243415), we get a palindrome (6488668846).
The spelling of 5143425431 in words is "five billion, one hundred forty-three million, four hundred twenty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •