Base | Representation |
---|---|
bin | 101111000110001111… |
… | …0110010111101011101 |
3 | 100200001200212210211120 |
4 | 1132030132302331131 |
5 | 3124114112143401 |
6 | 114244045241153 |
7 | 10210241300223 |
oct | 1361436627535 |
9 | 320050783746 |
10 | 101141131101 |
11 | 3999159385a |
12 | 17727b631b9 |
13 | 96cb061a4a |
14 | 4c76828b13 |
15 | 296e4e7836 |
hex | 178c7b2f5d |
101141131101 has 8 divisors (see below), whose sum is σ = 134930228640. Its totient is φ = 67389727152.
The previous prime is 101141131099. The next prime is 101141131103. The reversal of 101141131101 is 101131141101.
It is an interprime number because it is at equal distance from previous prime (101141131099) and next prime (101141131103).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101141131101 - 21 = 101141131099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101141131103) 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, 9417135 + ... + 9427868.
It is an arithmetic number, because the mean of its divisors is an integer number (16866278580).
Almost surely, 2101141131101 is an apocalyptic number.
It is an amenable number.
101141131101 is a deficient number, since it is larger than the sum of its proper divisors (33789097539).
101141131101 is a wasteful number, since it uses less digits than its factorization.
101141131101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18846795.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 101141131101 its reverse (101131141101), we get a palindrome (202272272202).
The spelling of 101141131101 in words is "one hundred one billion, one hundred forty-one million, one hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •