Base | Representation |
---|---|
bin | 1001101110111100… |
… | …01100101011011111 |
3 | 111111011221112022211 |
4 | 10313132030223133 |
5 | 41200230133211 |
6 | 2222311221251 |
7 | 243332061100 |
oct | 46736145337 |
9 | 14434845284 |
10 | 5225630431 |
11 | 224180653a |
12 | 101a077827 |
13 | 65381b018 |
14 | 3780363a7 |
15 | 208b74e21 |
hex | 13778cadf |
5225630431 has 12 divisors (see below), whose sum is σ = 6107616120. Its totient is φ = 4457874960.
The previous prime is 5225630411. The next prime is 5225630447. The reversal of 5225630431 is 1340365225.
It is a happy number.
It is not a de Polignac number, because 5225630431 - 219 = 5225106143 is a prime.
It is a super-2 number, since 2×52256304312 = 54614426802786491522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5225630393 and 5225630402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5225630411) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 242376 + ... + 263053.
It is an arithmetic number, because the mean of its divisors is an integer number (508968010).
Almost surely, 25225630431 is an apocalyptic number.
5225630431 is a deficient number, since it is larger than the sum of its proper divisors (881985689).
5225630431 is a wasteful number, since it uses less digits than its factorization.
5225630431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505654 (or 505647 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 31.
The square root of 5225630431 is about 72288.5221248851. The cubic root of 5225630431 is about 1735.3199675643.
Adding to 5225630431 its reverse (1340365225), we get a palindrome (6565995656).
The spelling of 5225630431 in words is "five billion, two hundred twenty-five million, six hundred thirty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •