Base | Representation |
---|---|
bin | 101111000011001110… |
… | …1100010111101101111 |
3 | 100122210122211221021201 |
4 | 1132012131202331233 |
5 | 3123412233441033 |
6 | 114230040510331 |
7 | 10204604010025 |
oct | 1360635427557 |
9 | 318718757251 |
10 | 101040140143 |
11 | 3993a585858 |
12 | 176ba17b3a7 |
13 | 96b3162197 |
14 | 4c6725a715 |
15 | 29656e947d |
hex | 1786762f6f |
101040140143 has 8 divisors (see below), whose sum is σ = 103395132368. Its totient is φ = 98685385344.
The previous prime is 101040140111. The next prime is 101040140153. The reversal of 101040140143 is 341041040101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101040140143 - 25 = 101040140111 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 101040140143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101040140153) 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, 1033255 + ... + 1126807.
It is an arithmetic number, because the mean of its divisors is an integer number (12924391546).
Almost surely, 2101040140143 is an apocalyptic number.
101040140143 is a deficient number, since it is larger than the sum of its proper divisors (2354992225).
101040140143 is an equidigital number, since it uses as much as digits as its factorization.
101040140143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118713.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 101040140143 its reverse (341041040101), we get a palindrome (442081180244).
The spelling of 101040140143 in words is "one hundred one billion, forty million, one hundred forty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •