Base | Representation |
---|---|
bin | 1110000110100110100111… |
… | …00100100000111111111001 |
3 | 11001210211112011112120212102 |
4 | 13003103103210200333321 |
5 | 13031110030120121131 |
6 | 145543135031353145 |
7 | 6350426224503665 |
oct | 703232344407771 |
9 | 131724464476772 |
10 | 31013213442041 |
11 | 99776a2525586 |
12 | 358a69a5227b5 |
13 | 143c6c208c23c |
14 | 79309463d8a5 |
15 | 38bad15a41cb |
hex | 1c34d3920ff9 |
31013213442041 has 8 divisors (see below), whose sum is σ = 31978306450944. Its totient is φ = 30054799278000.
The previous prime is 31013213442031. The next prime is 31013213442049. The reversal of 31013213442041 is 14024431231013.
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 31013213442041 - 222 = 31013209247737 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31013213441995 and 31013213442013.
It is not an unprimeable number, because it can be changed into a prime (31013213442049) 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, 1669701785 + ... + 1669720358.
It is an arithmetic number, because the mean of its divisors is an integer number (3997288306368).
Almost surely, 231013213442041 is an apocalyptic number.
It is an amenable number.
31013213442041 is a deficient number, since it is larger than the sum of its proper divisors (965093008903).
31013213442041 is a wasteful number, since it uses less digits than its factorization.
31013213442041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3339422431.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 31013213442041 its reverse (14024431231013), we get a palindrome (45037644673054).
The spelling of 31013213442041 in words is "thirty-one trillion, thirteen billion, two hundred thirteen million, four hundred forty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •