Base | Representation |
---|---|
bin | 1110001001101101110000… |
… | …10111110010011110011001 |
3 | 11002012001111110100200202120 |
4 | 13010312320113302132121 |
5 | 13034333012103201241 |
6 | 150104220240251453 |
7 | 6361232602360164 |
oct | 704667027623631 |
9 | 132161443320676 |
10 | 31120131303321 |
11 | 9a08a78903205 |
12 | 35a7359010b89 |
13 | 1449800b75c08 |
14 | 798318358adb |
15 | 38e78ccd0666 |
hex | 1c4db85f2799 |
31120131303321 has 8 divisors (see below), whose sum is σ = 41564195814624. Its totient is φ = 20711410497120.
The previous prime is 31120131303311. The next prime is 31120131303329. The reversal of 31120131303321 is 12330313102113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31120131303321 - 210 = 31120131302297 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31120131303291 and 31120131303300.
It is not an unprimeable number, because it can be changed into a prime (31120131303329) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8835924220 + ... + 8835927741.
It is an arithmetic number, because the mean of its divisors is an integer number (5195524476828).
Almost surely, 231120131303321 is an apocalyptic number.
It is an amenable number.
31120131303321 is a deficient number, since it is larger than the sum of its proper divisors (10444064511303).
31120131303321 is a wasteful number, since it uses less digits than its factorization.
31120131303321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17671852551.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 31120131303321 its reverse (12330313102113), we get a palindrome (43450444405434).
The spelling of 31120131303321 in words is "thirty-one trillion, one hundred twenty billion, one hundred thirty-one million, three hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •