Base | Representation |
---|---|
bin | 101111000110001111… |
… | …0110011101111100111 |
3 | 100200001200212222020110 |
4 | 1132030132303233213 |
5 | 3124114112244221 |
6 | 114244045304103 |
7 | 10210241312460 |
oct | 1361436635747 |
9 | 320050788213 |
10 | 101141134311 |
11 | 39991596208 |
12 | 17727b65033 |
13 | 96cb063349 |
14 | 4c76829d67 |
15 | 296e4e8776 |
hex | 178c7b3be7 |
101141134311 has 8 divisors (see below), whose sum is σ = 154119823744. Its totient is φ = 57794933880.
The previous prime is 101141134301. The next prime is 101141134319. The reversal of 101141134311 is 113431141101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101141134311 - 26 = 101141134247 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 4816244491 = 101141134311 / (1 + 0 + 1 + 1 + 4 + 1 + 1 + 3 + 4 + 3 + 1 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101141134319) 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, 2408122225 + ... + 2408122266.
It is an arithmetic number, because the mean of its divisors is an integer number (19264977968).
Almost surely, 2101141134311 is an apocalyptic number.
101141134311 is a deficient number, since it is larger than the sum of its proper divisors (52978689433).
101141134311 is an equidigital number, since it uses as much as digits as its factorization.
101141134311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4816244501.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 101141134311 its reverse (113431141101), we get a palindrome (214572275412).
The spelling of 101141134311 in words is "one hundred one billion, one hundred forty-one million, one hundred thirty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •