Base | Representation |
---|---|
bin | 100110100101001100000… |
… | …0110100110111010001011 |
3 | 200202220210020100100122122 |
4 | 1031022120012212322023 |
5 | 1143334101111343311 |
6 | 15135542015041455 |
7 | 1055044631120450 |
oct | 115123006467213 |
9 | 20686706310578 |
10 | 5302541512331 |
11 | 17648824a0678 |
12 | 71780251028b |
13 | 2c60485c830b |
14 | 144904263827 |
15 | 92de80ab0db |
hex | 4d2981a6e8b |
5302541512331 has 16 divisors (see below), whose sum is σ = 6062649139200. Its totient is φ = 4543084754208.
The previous prime is 5302541512327. The next prime is 5302541512337. The reversal of 5302541512331 is 1332151452035.
It is a happy number.
It is not a de Polignac number, because 5302541512331 - 22 = 5302541512327 is a prime.
It is a super-2 number, since 2×53025415123312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5302541512291 and 5302541512300.
It is not an unprimeable number, because it can be changed into a prime (5302541512337) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 208428710 + ... + 208454148.
It is an arithmetic number, because the mean of its divisors is an integer number (378915571200).
Almost surely, 25302541512331 is an apocalyptic number.
5302541512331 is a deficient number, since it is larger than the sum of its proper divisors (760107626869).
5302541512331 is a wasteful number, since it uses less digits than its factorization.
5302541512331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37058.
The product of its (nonzero) digits is 54000, while the sum is 35.
Adding to 5302541512331 its reverse (1332151452035), we get a palindrome (6634692964366).
The spelling of 5302541512331 in words is "five trillion, three hundred two billion, five hundred forty-one million, five hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •