Base | Representation |
---|---|
bin | 1110001001101101100011… |
… | …10000011101011000011101 |
3 | 11002012001012201112200000001 |
4 | 13010312301300131120131 |
5 | 13034332300201030023 |
6 | 150104201233534301 |
7 | 6361230054202636 |
oct | 704666160353035 |
9 | 132161181480001 |
10 | 31120020330013 |
11 | 9a08a211a732a |
12 | 35a7327a14391 |
13 | 14497b3b8c834 |
14 | 79830770c88d |
15 | 38e7831ae6ad |
hex | 1c4db1c1d61d |
31120020330013 has 8 divisors (see below), whose sum is σ = 31198636563840. Its totient is φ = 31041405244080.
The previous prime is 31120020330001. The next prime is 31120020330037. The reversal of 31120020330013 is 31003302002113.
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 31120020330013 - 29 = 31120020329501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31120020330073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89035848 + ... + 89384686.
It is an arithmetic number, because the mean of its divisors is an integer number (3899829570480).
Almost surely, 231120020330013 is an apocalyptic number.
It is an amenable number.
31120020330013 is a deficient number, since it is larger than the sum of its proper divisors (78616233827).
31120020330013 is a wasteful number, since it uses less digits than its factorization.
31120020330013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 573947.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 31120020330013 its reverse (31003302002113), we get a palindrome (62123322332126).
The spelling of 31120020330013 in words is "thirty-one trillion, one hundred twenty billion, twenty million, three hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •