Base | Representation |
---|---|
bin | 11101110100000011010100… |
… | …101100110100111011110001 |
3 | 122012020222111020210211102002 |
4 | 131310003110230310323301 |
5 | 114141233414003230413 |
6 | 1142511503104503345 |
7 | 36422063004544460 |
oct | 3564032454647361 |
9 | 565228436724362 |
10 | 131120330133233 |
11 | 38862902073221 |
12 | 12857bb931ab55 |
13 | 582179525669c |
14 | 24543877269d7 |
15 | 1025b19c77958 |
hex | 7740d4b34ef1 |
131120330133233 has 16 divisors (see below), whose sum is σ = 150243021624960. Its totient is φ = 112095621470976.
The previous prime is 131120330133181. The next prime is 131120330133239. The reversal of 131120330133233 is 332331033021131.
It is a cyclic number.
It is not a de Polignac number, because 131120330133233 - 236 = 131051610656497 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131120330133196 and 131120330133205.
It is not an unprimeable number, because it can be changed into a prime (131120330133239) 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, 1345433 + ... + 16249641.
It is an arithmetic number, because the mean of its divisors is an integer number (9390188851560).
Almost surely, 2131120330133233 is an apocalyptic number.
It is an amenable number.
131120330133233 is a deficient number, since it is larger than the sum of its proper divisors (19122691491727).
131120330133233 is a wasteful number, since it uses less digits than its factorization.
131120330133233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14907496.
The product of its (nonzero) digits is 8748, while the sum is 29.
Adding to 131120330133233 its reverse (332331033021131), we get a palindrome (463451363154364).
The spelling of 131120330133233 in words is "one hundred thirty-one trillion, one hundred twenty billion, three hundred thirty million, one hundred thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •