Base | Representation |
---|---|
bin | 1110001100000010100100… |
… | …00111011111000111011001 |
3 | 11002110200201001021200210210 |
4 | 13012001102013133013121 |
5 | 13042140120123213223 |
6 | 150205031423201333 |
7 | 6400061404252104 |
oct | 706012207370731 |
9 | 132420631250723 |
10 | 31200020132313 |
11 | 9a39943a8891a |
12 | 35ba933746249 |
13 | 14541c2c55666 |
14 | 79c13643573b |
15 | 3918b663e893 |
hex | 1c60521df1d9 |
31200020132313 has 8 divisors (see below), whose sum is σ = 41840489426688. Its totient is φ = 20679782129744.
The previous prime is 31200020132287. The next prime is 31200020132321. The reversal of 31200020132313 is 31323102000213.
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 31200020132313 - 213 = 31200020124121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 31200020132313.
It is not an unprimeable number, because it can be changed into a prime (31200020132353) 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, 30057822345 + ... + 30057823382.
It is an arithmetic number, because the mean of its divisors is an integer number (5230061178336).
Almost surely, 231200020132313 is an apocalyptic number.
It is an amenable number.
31200020132313 is a deficient number, since it is larger than the sum of its proper divisors (10640469294375).
31200020132313 is a wasteful number, since it uses less digits than its factorization.
31200020132313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60115645903.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 31200020132313 its reverse (31323102000213), we get a palindrome (62523122132526).
The spelling of 31200020132313 in words is "thirty-one trillion, two hundred billion, twenty million, one hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •