Base | Representation |
---|---|
bin | 10110101110101000… |
… | …01101001111001011 |
3 | 1011111101211202020010 |
4 | 23113110031033023 |
5 | 144442244130011 |
6 | 5334454203003 |
7 | 611246056152 |
oct | 132724151713 |
9 | 34441752203 |
10 | 12202333131 |
11 | 51a199853a |
12 | 2446653463 |
13 | 11c6057a81 |
14 | 83a84a599 |
15 | 4b63db1a6 |
hex | 2d750d3cb |
12202333131 has 8 divisors (see below), whose sum is σ = 16304618304. Its totient is φ = 8117468360.
The previous prime is 12202333051. The next prime is 12202333141. The reversal of 12202333131 is 13133320221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12202333131 - 218 = 12202070987 is a prime.
It is a super-2 number, since 2×122023331312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12202333098 and 12202333107.
It is not an unprimeable number, because it can be changed into a prime (12202333141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4353465 + ... + 4356266.
It is an arithmetic number, because the mean of its divisors is an integer number (2038077288).
Almost surely, 212202333131 is an apocalyptic number.
12202333131 is a deficient number, since it is larger than the sum of its proper divisors (4102285173).
12202333131 is an equidigital number, since it uses as much as digits as its factorization.
12202333131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8710201.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 12202333131 its reverse (13133320221), we get a palindrome (25335653352).
The spelling of 12202333131 in words is "twelve billion, two hundred two million, three hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •