Base | Representation |
---|---|
bin | 100110100101101001100… |
… | …0010100101100110010011 |
3 | 200210000100010221200201112 |
4 | 1031023103002211212103 |
5 | 1143343112230023011 |
6 | 15140224100323535 |
7 | 1055111265601520 |
oct | 115132302454623 |
9 | 20700303850645 |
10 | 5303530314131 |
11 | 176523a666045 |
12 | 717a396a35ab |
13 | 2c617541443a |
14 | 1449996d8147 |
15 | 92e54cc958b |
hex | 4d2d30a5993 |
5303530314131 has 4 divisors (see below), whose sum is σ = 6061177501872. Its totient is φ = 4545883126392.
The previous prime is 5303530314119. The next prime is 5303530314211. The reversal of 5303530314131 is 1314130353035.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5303530314131 - 226 = 5303463205267 is a prime.
It is a super-3 number, since 3×53035303141313 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5303530314101) 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, 378823593860 + ... + 378823593873.
It is an arithmetic number, because the mean of its divisors is an integer number (1515294375468).
Almost surely, 25303530314131 is an apocalyptic number.
5303530314131 is a deficient number, since it is larger than the sum of its proper divisors (757647187741).
5303530314131 is an equidigital number, since it uses as much as digits as its factorization.
5303530314131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 757647187740.
The product of its (nonzero) digits is 24300, while the sum is 32.
Adding to 5303530314131 its reverse (1314130353035), we get a palindrome (6617660667166).
The spelling of 5303530314131 in words is "five trillion, three hundred three billion, five hundred thirty million, three hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •