Base | Representation |
---|---|
bin | 1001110001111110… |
… | …00100101000010111 |
3 | 111112221201201201101 |
4 | 10320333010220113 |
5 | 41223230303211 |
6 | 2225015410531 |
7 | 244060660021 |
oct | 47077045027 |
9 | 14487651641 |
10 | 5251025431 |
11 | 2255081143 |
12 | 1026683a47 |
13 | 658b6cc52 |
14 | 37b567011 |
15 | 20aede5c1 |
hex | 138fc4a17 |
5251025431 has 6 divisors (see below), whose sum is σ = 5382224696. Its totient is φ = 5122950000.
The previous prime is 5251025341. The next prime is 5251025449. The reversal of 5251025431 is 1345201525.
It is not a de Polignac number, because 5251025431 - 211 = 5251023383 is a prime.
It is a super-2 number, since 2×52510254312 = 55146536154017471522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5251025431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5251025531) 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 in 5 ways as a sum of consecutive naturals, for example, 1560195 + ... + 1563556.
Almost surely, 25251025431 is an apocalyptic number.
5251025431 is a deficient number, since it is larger than the sum of its proper divisors (131199265).
5251025431 is an equidigital number, since it uses as much as digits as its factorization.
5251025431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3123833 (or 3123792 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 28.
The square root of 5251025431 is about 72463.9595316182. The cubic root of 5251025431 is about 1738.1264714412.
Adding to 5251025431 its reverse (1345201525), we get a palindrome (6596226956).
The spelling of 5251025431 in words is "five billion, two hundred fifty-one million, twenty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •