Base | Representation |
---|---|
bin | 101111000110010011… |
… | …0010111001001000111 |
3 | 100200001211121120021210 |
4 | 1132030212113021013 |
5 | 3124120114124221 |
6 | 114244155542503 |
7 | 10210264200201 |
oct | 1361446271107 |
9 | 320054546253 |
10 | 101143114311 |
11 | 39992718878 |
12 | 1772875aa33 |
13 | 96cb5a7645 |
14 | 4c76bc3771 |
15 | 296e78a276 |
hex | 178c997247 |
101143114311 has 4 divisors (see below), whose sum is σ = 134857485752. Its totient is φ = 67428742872.
The previous prime is 101143114279. The next prime is 101143114351. The reversal of 101143114311 is 113411341101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113411341101 = 3 ⋅37803780367.
It is not a de Polignac number, because 101143114311 - 25 = 101143114279 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 (101143114351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16857185716 + ... + 16857185721.
It is an arithmetic number, because the mean of its divisors is an integer number (33714371438).
Almost surely, 2101143114311 is an apocalyptic number.
101143114311 is a deficient number, since it is larger than the sum of its proper divisors (33714371441).
101143114311 is an equidigital number, since it uses as much as digits as its factorization.
101143114311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33714371440.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 101143114311 its reverse (113411341101), we get a palindrome (214554455412).
The spelling of 101143114311 in words is "one hundred one billion, one hundred forty-three million, one hundred fourteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •