Base | Representation |
---|---|
bin | 11101110110101110011000… |
… | …111111101100101100111110 |
3 | 122012220112121100201112121220 |
4 | 131312232120333230230332 |
5 | 114202241104040303042 |
6 | 1143132121433334210 |
7 | 36441254552156562 |
oct | 3566563077545476 |
9 | 565815540645556 |
10 | 131304012041022 |
11 | 3892379a7881a7 |
12 | 1288771bb67366 |
13 | 5835bb89288a2 |
14 | 245d2105136a2 |
15 | 102a7ba8218ec |
hex | 776b98fecb3e |
131304012041022 has 32 divisors (see below), whose sum is σ = 263069142964992. Its totient is φ = 43691196609984.
The previous prime is 131304012041003. The next prime is 131304012041023. The reversal of 131304012041022 is 220140210403131.
It is a junction number, because it is equal to n+sod(n) for n = 131304012040983 and 131304012041001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131304012041023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5768893 + ... + 17201399.
It is an arithmetic number, because the mean of its divisors is an integer number (8220910717656).
Almost surely, 2131304012041022 is an apocalyptic number.
131304012041022 is an abundant number, since it is smaller than the sum of its proper divisors (131765130923970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131304012041022 is a wasteful number, since it uses less digits than its factorization.
131304012041022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11435872.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 131304012041022 its reverse (220140210403131), we get a palindrome (351444222444153).
The spelling of 131304012041022 in words is "one hundred thirty-one trillion, three hundred four billion, twelve million, forty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •