Base | Representation |
---|---|
bin | 1110000110110011110100… |
… | …00010001101010111100111 |
3 | 11001211111211010102120011222 |
4 | 13003121322002031113213 |
5 | 13031214034102223421 |
6 | 145550310223050555 |
7 | 6351066660524522 |
oct | 703317202152747 |
9 | 131744733376158 |
10 | 31020301211111 |
11 | 997a6aa377373 |
12 | 358bb38140a5b |
13 | 1440281615834 |
14 | 793567ac5bb9 |
15 | 38bd98958cab |
hex | 1c367a08d5e7 |
31020301211111 has 8 divisors (see below), whose sum is σ = 31528949991264. Its totient is φ = 30511656277920.
The previous prime is 31020301211071. The next prime is 31020301211143. The reversal of 31020301211111 is 11111210302013.
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 31020301211111 - 26 = 31020301211047 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 31020301211111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31020301211411) 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, 18500150 + ... + 20107116.
It is an arithmetic number, because the mean of its divisors is an integer number (3941118748908).
Almost surely, 231020301211111 is an apocalyptic number.
31020301211111 is a deficient number, since it is larger than the sum of its proper divisors (508648780153).
31020301211111 is a wasteful number, since it uses less digits than its factorization.
31020301211111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1923481.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 31020301211111 its reverse (11111210302013), we get a palindrome (42131511513124).
The spelling of 31020301211111 in words is "thirty-one trillion, twenty billion, three hundred one million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •