Base | Representation |
---|---|
bin | 100110100101001100000… |
… | …0010011110110001011111 |
3 | 200202220210011022101120021 |
4 | 1031022120002132301133 |
5 | 1143334100322233211 |
6 | 15135541535533011 |
7 | 1055044615663306 |
oct | 115123002366137 |
9 | 20686704271507 |
10 | 5302540430431 |
11 | 1764881921842 |
12 | 71780208a167 |
13 | 2c6048309a3a |
14 | 14490406143d |
15 | 92de7e45771 |
hex | 4d29809ec5f |
5302540430431 has 4 divisors (see below), whose sum is σ = 5485386652200. Its totient is φ = 5119694208664.
The previous prime is 5302540430353. The next prime is 5302540430513. The reversal of 5302540430431 is 1340340452035.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5302540430431 is a prime.
It is a super-2 number, since 2×53025404304312 (a number of 26 digits) 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 (5302540470431) 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, 91423110841 + ... + 91423110898.
It is an arithmetic number, because the mean of its divisors is an integer number (1371346663050).
Almost surely, 25302540430431 is an apocalyptic number.
5302540430431 is a deficient number, since it is larger than the sum of its proper divisors (182846221769).
5302540430431 is a wasteful number, since it uses less digits than its factorization.
5302540430431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182846221768.
The product of its (nonzero) digits is 86400, while the sum is 34.
Adding to 5302540430431 its reverse (1340340452035), we get a palindrome (6642880882466).
The spelling of 5302540430431 in words is "five trillion, three hundred two billion, five hundred forty million, four hundred thirty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •