Base | Representation |
---|---|
bin | 1000001011000111100… |
… | …0001010010101100111 |
3 | 111102110100002212010222 |
4 | 2002301320022111213 |
5 | 4300041322234421 |
6 | 144302021234555 |
7 | 13100550605144 |
oct | 2026170122547 |
9 | 442410085128 |
10 | 140423243111 |
11 | 5460a294a38 |
12 | 2326b562a5b |
13 | 1031b480bc8 |
14 | 6b219233cb |
15 | 39bce76cab |
hex | 20b1e0a567 |
140423243111 has 4 divisors (see below), whose sum is σ = 140438500800. Its totient is φ = 140407985424.
The previous prime is 140423243099. The next prime is 140423243159. The reversal of 140423243111 is 111342324041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140423243111 is a prime.
It is a super-2 number, since 2×1404232431112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140423243011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7615031 + ... + 7633448.
It is an arithmetic number, because the mean of its divisors is an integer number (35109625200).
Almost surely, 2140423243111 is an apocalyptic number.
140423243111 is a deficient number, since it is larger than the sum of its proper divisors (15257689).
140423243111 is an equidigital number, since it uses as much as digits as its factorization.
140423243111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15257688.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 140423243111 its reverse (111342324041), we get a palindrome (251765567152).
The spelling of 140423243111 in words is "one hundred forty billion, four hundred twenty-three million, two hundred forty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •