Base | Representation |
---|---|
bin | 1110010110010100101001… |
… | …01011010010010001001101 |
3 | 11010201110122102002102212111 |
4 | 13023022110223102101031 |
5 | 13113432201434201110 |
6 | 151035221430104021 |
7 | 6434436533556556 |
oct | 713122453222115 |
9 | 133643572072774 |
10 | 31553324131405 |
11 | a06576497362a |
12 | 36572b44ab011 |
13 | 147b6091a661b |
14 | 7b1290a0532d |
15 | 39ab93785e8a |
hex | 1cb294ad244d |
31553324131405 has 8 divisors (see below), whose sum is σ = 37925158572000. Its totient is φ = 25201879562256.
The previous prime is 31553324131391. The next prime is 31553324131507. The reversal of 31553324131405 is 50413142335513.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31553324131405 - 221 = 31553322034253 is a prime.
It is a super-4 number, since 4×315533241314054 (a number of 55 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5097464455 + ... + 5097470644.
It is an arithmetic number, because the mean of its divisors is an integer number (4740644821500).
Almost surely, 231553324131405 is an apocalyptic number.
It is an amenable number.
31553324131405 is a deficient number, since it is larger than the sum of its proper divisors (6371834440595).
31553324131405 is a wasteful number, since it uses less digits than its factorization.
31553324131405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10194935723.
The product of its (nonzero) digits is 324000, while the sum is 40.
Adding to 31553324131405 its reverse (50413142335513), we get a palindrome (81966466466918).
The spelling of 31553324131405 in words is "thirty-one trillion, five hundred fifty-three billion, three hundred twenty-four million, one hundred thirty-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •