Base | Representation |
---|---|
bin | 11101110011111011101100… |
… | …000011100011001011101100 |
3 | 122012020012022220122002121220 |
4 | 131303323230003203023230 |
5 | 114141120121244444322 |
6 | 1142504025411023340 |
7 | 36421352600043423 |
oct | 3563735403431354 |
9 | 565205286562556 |
10 | 131112132031212 |
11 | 3885a3854998a2 |
12 | 128564ab89ab50 |
13 | 5820a89972147 |
14 | 2453c0aa122ba |
15 | 10257da19a55c |
hex | 773eec0e32ec |
131112132031212 has 24 divisors (see below), whose sum is σ = 306300936972912. Its totient is φ = 43650811310400.
The previous prime is 131112132031211. The next prime is 131112132031219. The reversal of 131112132031212 is 212130231211131.
It is not an unprimeable number, because it can be changed into a prime (131112132031211) 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, 6654077239 + ... + 6654096942.
It is an arithmetic number, because the mean of its divisors is an integer number (12762539040538).
Almost surely, 2131112132031212 is an apocalyptic number.
131112132031212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131112132031212 is an abundant number, since it is smaller than the sum of its proper divisors (175188804941700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131112132031212 is a wasteful number, since it uses less digits than its factorization.
131112132031212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13308175009 (or 13308175007 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 131112132031212 its reverse (212130231211131), we get a palindrome (343242363242343).
The spelling of 131112132031212 in words is "one hundred thirty-one trillion, one hundred twelve billion, one hundred thirty-two million, thirty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •