Base | Representation |
---|---|
bin | 1110000110100110110011… |
… | …00000101011101000101011 |
3 | 11001210211210010001202100012 |
4 | 13003103121200223220223 |
5 | 13031110231123202311 |
6 | 145543152551402135 |
7 | 6350431544543642 |
oct | 703233140535053 |
9 | 131724703052305 |
10 | 31013313100331 |
11 | 9977743803301 |
12 | 358a70798334b |
13 | 143c709913343 |
14 | 7930a3982359 |
15 | 38bada1dc78b |
hex | 1c34d982ba2b |
31013313100331 has 16 divisors (see below), whose sum is σ = 31433315760000. Its totient is φ = 30595415758848.
The previous prime is 31013313100327. The next prime is 31013313100339. The reversal of 31013313100331 is 13300131331013.
It is a cyclic number.
It is not a de Polignac number, because 31013313100331 - 22 = 31013313100327 is a prime.
It is a super-2 number, since 2×310133131003312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31013313100297 and 31013313100306.
It is not an unprimeable number, because it can be changed into a prime (31013313100339) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 102186095 + ... + 102489143.
It is an arithmetic number, because the mean of its divisors is an integer number (1964582235000).
Almost surely, 231013313100331 is an apocalyptic number.
31013313100331 is a deficient number, since it is larger than the sum of its proper divisors (420002659669).
31013313100331 is a wasteful number, since it uses less digits than its factorization.
31013313100331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 306518.
The product of its (nonzero) digits is 729, while the sum is 23.
Adding to 31013313100331 its reverse (13300131331013), we get a palindrome (44313444431344).
The spelling of 31013313100331 in words is "thirty-one trillion, thirteen billion, three hundred thirteen million, one hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •