Base | Representation |
---|---|
bin | 1110010111110101101110… |
… | …00110101001001011110011 |
3 | 11010220110011112210202021020 |
4 | 13023322313012221023303 |
5 | 13120310420440223201 |
6 | 151115201142430523 |
7 | 6441263204523612 |
oct | 713726706511363 |
9 | 133813145722236 |
10 | 31605441336051 |
11 | a085879755890 |
12 | 366541a432443 |
13 | 14834c377915b |
14 | 7b39d65bd879 |
15 | 39c1e3e40a36 |
hex | 1cbeb71a92f3 |
31605441336051 has 16 divisors (see below), whose sum is σ = 48675759919488. Its totient is φ = 18028059228800.
The previous prime is 31605441335959. The next prime is 31605441336113. The reversal of 31605441336051 is 15063314450613.
It is a cyclic number.
It is not a de Polignac number, because 31605441336051 - 29 = 31605441335539 is a prime.
It is a super-2 number, since 2×316054413360512 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31605441335994 and 31605441336012.
It is not an unprimeable number, because it can be changed into a prime (31605441336151) 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, 28168841985 + ... + 28168843106.
It is an arithmetic number, because the mean of its divisors is an integer number (3042234994968).
Almost surely, 231605441336051 is an apocalyptic number.
31605441336051 is a deficient number, since it is larger than the sum of its proper divisors (17070318583437).
31605441336051 is a wasteful number, since it uses less digits than its factorization.
31605441336051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56337685122.
The product of its (nonzero) digits is 388800, while the sum is 42.
Adding to 31605441336051 its reverse (15063314450613), we get a palindrome (46668755786664).
The spelling of 31605441336051 in words is "thirty-one trillion, six hundred five billion, four hundred forty-one million, three hundred thirty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •