Base | Representation |
---|---|
bin | 11101110010011100101011… |
… | …101111001110111011100101 |
3 | 122011212110000121022120120001 |
4 | 131302130223233032323211 |
5 | 114132432212013411401 |
6 | 1142345115133341301 |
7 | 36411111635415016 |
oct | 3562345357167345 |
9 | 564773017276501 |
10 | 131010121232101 |
11 | 38820098010651 |
12 | 1283a780637831 |
13 | 58142806a6b57 |
14 | 244ccd08c500d |
15 | 1022d19668601 |
hex | 77272bbceee5 |
131010121232101 has 8 divisors (see below), whose sum is σ = 135443354125824. Its totient is φ = 126589832085360.
The previous prime is 131010121232069. The next prime is 131010121232117. The reversal of 131010121232101 is 101232121010131.
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 131010121232101 - 25 = 131010121232069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131010121232161) 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, 3235916161 + ... + 3235956646.
It is an arithmetic number, because the mean of its divisors is an integer number (16930419265728).
Almost surely, 2131010121232101 is an apocalyptic number.
It is an amenable number.
131010121232101 is a deficient number, since it is larger than the sum of its proper divisors (4433232893723).
131010121232101 is an equidigital number, since it uses as much as digits as its factorization.
131010121232101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6471873491.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 131010121232101 its reverse (101232121010131), we get a palindrome (232242242242232).
The spelling of 131010121232101 in words is "one hundred thirty-one trillion, ten billion, one hundred twenty-one million, two hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •