Base | Representation |
---|---|
bin | 1110000110110011011101… |
… | …10001010001010010000001 |
3 | 11001211111022221210212220211 |
4 | 13003121232301101102001 |
5 | 13031213142212040223 |
6 | 145550235352234121 |
7 | 6351062204245045 |
oct | 703315661212201 |
9 | 131744287725824 |
10 | 31020112221313 |
11 | 997a612724556 |
12 | 358baa499b941 |
13 | 1440251414b57 |
14 | 79354a96c025 |
15 | 38bd87076d0d |
hex | 1c366ec51481 |
31020112221313 has 8 divisors (see below), whose sum is σ = 31321582344000. Its totient is φ = 30718647944688.
The previous prime is 31020112221253. The next prime is 31020112221341. The reversal of 31020112221313 is 31312221102013.
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 31020112221313 - 233 = 31011522286721 is a prime.
It is a super-3 number, since 3×310201122213133 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31020112222313) 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, 9607758 + ... + 12423736.
It is an arithmetic number, because the mean of its divisors is an integer number (3915197793000).
Almost surely, 231020112221313 is an apocalyptic number.
It is an amenable number.
31020112221313 is a deficient number, since it is larger than the sum of its proper divisors (301470122687).
31020112221313 is a wasteful number, since it uses less digits than its factorization.
31020112221313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2923031.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 31020112221313 its reverse (31312221102013), we get a palindrome (62332333323326).
The spelling of 31020112221313 in words is "thirty-one trillion, twenty billion, one hundred twelve million, two hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •