Base | Representation |
---|---|
bin | 101111001011100100… |
… | …1100011100000001111 |
3 | 100200112011122222200001 |
4 | 1132113021203200033 |
5 | 3130000422042033 |
6 | 114313521345131 |
7 | 10214543512645 |
oct | 1362711434017 |
9 | 320464588601 |
10 | 101320112143 |
11 | 39a7361a978 |
12 | 17777a981a7 |
13 | 9729169ba3 |
14 | 4c924d9195 |
15 | 298009de7d |
hex | 179726380f |
101320112143 has 4 divisors (see below), whose sum is σ = 102747156048. Its totient is φ = 99893068240.
The previous prime is 101320112129. The next prime is 101320112167. The reversal of 101320112143 is 341211023101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101320112143 - 217 = 101319981071 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101320112143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101320119143) 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, 713521846 + ... + 713521987.
It is an arithmetic number, because the mean of its divisors is an integer number (25686789012).
Almost surely, 2101320112143 is an apocalyptic number.
101320112143 is a deficient number, since it is larger than the sum of its proper divisors (1427043905).
101320112143 is an equidigital number, since it uses as much as digits as its factorization.
101320112143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1427043904.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 101320112143 its reverse (341211023101), we get a palindrome (442531135244).
The spelling of 101320112143 in words is "one hundred one billion, three hundred twenty million, one hundred twelve thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •