Base | Representation |
---|---|
bin | 11101110101010011001111… |
… | …000101100110101110000001 |
3 | 122012120011222011101111112122 |
4 | 131311103033011212232001 |
5 | 114144140131114424413 |
6 | 1143015133315334025 |
7 | 36431221226534333 |
oct | 3565231705465601 |
9 | 565504864344478 |
10 | 131206135311233 |
11 | 38896233934474 |
12 | 128707652b1315 |
13 | 58298bac93a68 |
14 | 24585a7479453 |
15 | 1027e8cbe9108 |
hex | 7754cf166b81 |
131206135311233 has 16 divisors (see below), whose sum is σ = 135056829972480. Its totient is φ = 127399628288016.
The previous prime is 131206135311203. The next prime is 131206135311311. The reversal of 131206135311233 is 332113531602131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131206135311233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131206135311193 and 131206135311202.
It is not an unprimeable number, because it can be changed into a prime (131206135311203) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 214477088 + ... + 215087966.
It is an arithmetic number, because the mean of its divisors is an integer number (8441051873280).
Almost surely, 2131206135311233 is an apocalyptic number.
It is an amenable number.
131206135311233 is a deficient number, since it is larger than the sum of its proper divisors (3850694661247).
131206135311233 is a wasteful number, since it uses less digits than its factorization.
131206135311233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 647036.
The product of its (nonzero) digits is 29160, while the sum is 35.
Adding to 131206135311233 its reverse (332113531602131), we get a palindrome (463319666913364).
The spelling of 131206135311233 in words is "one hundred thirty-one trillion, two hundred six billion, one hundred thirty-five million, three hundred eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •