Base | Representation |
---|---|
bin | 11101110101001110011100… |
… | …111111111111000111100011 |
3 | 122012112200201021102011212111 |
4 | 131311032130333333013203 |
5 | 114144044122000311321 |
6 | 1143012523552140151 |
7 | 36430650042310255 |
oct | 3565163477770743 |
9 | 565480637364774 |
10 | 131201000010211 |
11 | 3889403911483a |
12 | 1286b771537657 |
13 | 58292800b18c1 |
14 | 245823b437cd5 |
15 | 1027c8be685e1 |
hex | 77539cfff1e3 |
131201000010211 has 8 divisors (see below), whose sum is σ = 131861018432000. Its totient is φ = 130540988757960.
The previous prime is 131201000010169. The next prime is 131201000010217. The reversal of 131201000010211 is 112010000102131.
It is a happy number.
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 131201000010211 - 27 = 131201000010083 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131201000010191 and 131201000010200.
It is not an unprimeable number, because it can be changed into a prime (131201000010217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37006276 + ... + 40396366.
It is an arithmetic number, because the mean of its divisors is an integer number (16482627304000).
Almost surely, 2131201000010211 is an apocalyptic number.
131201000010211 is a deficient number, since it is larger than the sum of its proper divisors (660018421789).
131201000010211 is a wasteful number, since it uses less digits than its factorization.
131201000010211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3584769.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 131201000010211 its reverse (112010000102131), we get a palindrome (243211000112342).
The spelling of 131201000010211 in words is "one hundred thirty-one trillion, two hundred one billion, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •