Base | Representation |
---|---|
bin | 11101110111001001100110… |
… | …101110000100011110110101 |
3 | 122020000100000211201211102210 |
4 | 131313021212232010132311 |
5 | 114203230430213030401 |
6 | 1143153353211124033 |
7 | 36443340645060315 |
oct | 3567114656043665 |
9 | 566010024654383 |
10 | 131333233330101 |
11 | 38935125401190 |
12 | 12891316143619 |
13 | 5838894882b9a |
14 | 24607c3375445 |
15 | 102b42adcb4d6 |
hex | 777266b847b5 |
131333233330101 has 32 divisors (see below), whose sum is σ = 191227758778368. Its totient is φ = 79513572607040.
The previous prime is 131333233330067. The next prime is 131333233330139. The reversal of 131333233330101 is 101033332333131.
It is not a de Polignac number, because 131333233330101 - 213 = 131333233321909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131333233330141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 815821120 + ... + 815982086.
It is an arithmetic number, because the mean of its divisors is an integer number (5975867461824).
Almost surely, 2131333233330101 is an apocalyptic number.
131333233330101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
131333233330101 is a deficient number, since it is larger than the sum of its proper divisors (59894525448267).
131333233330101 is a wasteful number, since it uses less digits than its factorization.
131333233330101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186401.
The product of its (nonzero) digits is 13122, while the sum is 30.
Adding to 131333233330101 its reverse (101033332333131), we get a palindrome (232366565663232).
The spelling of 131333233330101 in words is "one hundred thirty-one trillion, three hundred thirty-three billion, two hundred thirty-three million, three hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •