Base | Representation |
---|---|
bin | 101111001011010011… |
… | …1101011010101101101 |
3 | 100200111112221210111110 |
4 | 1132112213223111231 |
5 | 3124441133400331 |
6 | 114313003142233 |
7 | 10214405154255 |
oct | 1362647532555 |
9 | 320445853443 |
10 | 101311231341 |
11 | 39a69604671 |
12 | 17774b14979 |
13 | 972737a888 |
14 | 4c91266965 |
15 | 297e3e7946 |
hex | 17969eb56d |
101311231341 has 8 divisors (see below), whose sum is σ = 135121846144. Its totient is φ = 67520718720.
The previous prime is 101311231331. The next prime is 101311231361. The reversal of 101311231341 is 143132113101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101311231341 - 217 = 101311100269 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101311231331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5013781 + ... + 5033946.
It is an arithmetic number, because the mean of its divisors is an integer number (16890230768).
Almost surely, 2101311231341 is an apocalyptic number.
It is an amenable number.
101311231341 is a deficient number, since it is larger than the sum of its proper divisors (33810614803).
101311231341 is a wasteful number, since it uses less digits than its factorization.
101311231341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10051091.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 101311231341 its reverse (143132113101), we get a palindrome (244443344442).
The spelling of 101311231341 in words is "one hundred one billion, three hundred eleven million, two hundred thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •