Base | Representation |
---|---|
bin | 111101000011011100… |
… | …0101011000011000100 |
3 | 110112102102101211022200 |
4 | 1322012320223003010 |
5 | 4122004134202322 |
6 | 140122041354500 |
7 | 12321035541423 |
oct | 1720670530304 |
9 | 415372354280 |
10 | 131112022212 |
11 | 50671355956 |
12 | 214b1198a30 |
13 | c4963a4642 |
14 | 64bb0572ba |
15 | 36257c18ac |
hex | 1e86e2b0c4 |
131112022212 has 36 divisors (see below), whose sum is σ = 348865324080. Its totient is φ = 41403796272.
The previous prime is 131112022183. The next prime is 131112022247. The reversal of 131112022212 is 212220211131.
131112022212 is a `hidden beast` number, since 1 + 311 + 120 + 22 + 212 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 95841438 + ... + 95842805.
Almost surely, 2131112022212 is an apocalyptic number.
131112022212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131112022212 is an abundant number, since it is smaller than the sum of its proper divisors (217753301868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131112022212 is a wasteful number, since it uses less digits than its factorization.
131112022212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191684272 (or 191684267 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 131112022212 its reverse (212220211131), we get a palindrome (343332233343).
The spelling of 131112022212 in words is "one hundred thirty-one billion, one hundred twelve million, twenty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •