Base | Representation |
---|---|
bin | 1110000111000110000101… |
… | …10100100111101000000001 |
3 | 11001212110010212202112102022 |
4 | 13003203002310213220001 |
5 | 13031344132223220001 |
6 | 145555011541131225 |
7 | 6351565052550524 |
oct | 703430264475001 |
9 | 131773125675368 |
10 | 31030112320001 |
11 | 99838844a6723 |
12 | 3591a159b9b15 |
13 | 1441186138202 |
14 | 793c18b18bbb |
15 | 38c26ee5411b |
hex | 1c38c2d27a01 |
31030112320001 has 8 divisors (see below), whose sum is σ = 31128472113984. Its totient is φ = 30931755501520.
The previous prime is 31030112319989. The next prime is 31030112320043. The reversal of 31030112320001 is 10002321103013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31030112320001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31030112320091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21167276 + ... + 22585698.
It is an arithmetic number, because the mean of its divisors is an integer number (3891059014248).
Almost surely, 231030112320001 is an apocalyptic number.
It is an amenable number.
31030112320001 is a deficient number, since it is larger than the sum of its proper divisors (98359793983).
31030112320001 is a wasteful number, since it uses less digits than its factorization.
31030112320001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1487751.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 31030112320001 its reverse (10002321103013), we get a palindrome (41032433423014).
The spelling of 31030112320001 in words is "thirty-one trillion, thirty billion, one hundred twelve million, three hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •