Base | Representation |
---|---|
bin | 1110011000100110010001… |
… | …01011111110110010110101 |
3 | 11010222221110001022222222002 |
4 | 13030103020223332302311 |
5 | 13121222311032442331 |
6 | 151135151401545045 |
7 | 6443205131642642 |
oct | 714231053766265 |
9 | 133887401288862 |
10 | 31631506140341 |
11 | a095934648058 |
12 | 366a4934a5185 |
13 | 1485ab878c483 |
14 | 7b4d8a142dc9 |
15 | 39cc1c3459cb |
hex | 1cc4c8afecb5 |
31631506140341 has 16 divisors (see below), whose sum is σ = 33267637899264. Its totient is φ = 30017125442304.
The previous prime is 31631506140307. The next prime is 31631506140383. The reversal of 31631506140341 is 14304160513613.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31631506140341 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 31631506140295 and 31631506140304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31631506140391) 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, 116976605 + ... + 117246701.
It is an arithmetic number, because the mean of its divisors is an integer number (2079227368704).
Almost surely, 231631506140341 is an apocalyptic number.
It is an amenable number.
31631506140341 is a deficient number, since it is larger than the sum of its proper divisors (1636131758923).
31631506140341 is a wasteful number, since it uses less digits than its factorization.
31631506140341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310340.
The product of its (nonzero) digits is 77760, while the sum is 38.
Adding to 31631506140341 its reverse (14304160513613), we get a palindrome (45935666653954).
The spelling of 31631506140341 in words is "thirty-one trillion, six hundred thirty-one billion, five hundred six million, one hundred forty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •