Base | Representation |
---|---|
bin | 10111011100000001000… |
… | …101101011100000010011 |
3 | 12200222022122101100021221 |
4 | 113130001011223200103 |
5 | 202342033014032011 |
6 | 3231525204025511 |
7 | 224235636426244 |
oct | 27340105534023 |
9 | 5628278340257 |
10 | 1610631002131 |
11 | 571079236768 |
12 | 220199092297 |
13 | b8b60575248 |
14 | 57d52586ccb |
15 | 2bd69a85971 |
hex | 1770116b813 |
1610631002131 has 4 divisors (see below), whose sum is σ = 1611149059600. Its totient is φ = 1610112944664.
The previous prime is 1610631002107. The next prime is 1610631002143. The reversal of 1610631002131 is 1312001360161.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1610631002131 - 237 = 1473192048659 is a prime.
It is a super-2 number, since 2×16106310021312 (a number of 25 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 = 1610631002096 and 1610631002105.
It is not an unprimeable number, because it can be changed into a prime (1610631002161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 259024071 + ... + 259030288.
It is an arithmetic number, because the mean of its divisors is an integer number (402787264900).
Almost surely, 21610631002131 is an apocalyptic number.
1610631002131 is a deficient number, since it is larger than the sum of its proper divisors (518057469).
1610631002131 is an equidigital number, since it uses as much as digits as its factorization.
1610631002131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 518057468.
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 1610631002131 its reverse (1312001360161), we get a palindrome (2922632362292).
The spelling of 1610631002131 in words is "one trillion, six hundred ten billion, six hundred thirty-one million, two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •