Base | Representation |
---|---|
bin | 11101110010010100001110… |
… | …000110101010001111011001 |
3 | 122011211120120022022120020010 |
4 | 131302110032012222033121 |
5 | 114132310104213402301 |
6 | 1142341013321152133 |
7 | 36410340514306155 |
oct | 3562241606521731 |
9 | 564746508276203 |
10 | 131001034122201 |
11 | 38817254632471 |
12 | 12838a6532b649 |
13 | 5813462b77249 |
14 | 244c6abab6065 |
15 | 10229869d15d6 |
hex | 77250e1aa3d9 |
131001034122201 has 8 divisors (see below), whose sum is σ = 174669625601280. Its totient is φ = 87333232695632.
The previous prime is 131001034122199. The next prime is 131001034122209. The reversal of 131001034122201 is 102221430100131.
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 131001034122201 - 21 = 131001034122199 is a prime.
It is a super-2 number, since 2×1310010341222012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131001034122209) 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, 197126121 + ... + 197789558.
It is an arithmetic number, because the mean of its divisors is an integer number (21833703200160).
Almost surely, 2131001034122201 is an apocalyptic number.
It is an amenable number.
131001034122201 is a deficient number, since it is larger than the sum of its proper divisors (43668591479079).
131001034122201 is a wasteful number, since it uses less digits than its factorization.
131001034122201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 395026255.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 131001034122201 its reverse (102221430100131), we get a palindrome (233222464222332).
The spelling of 131001034122201 in words is "one hundred thirty-one trillion, one billion, thirty-four million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •