Base | Representation |
---|---|
bin | 1000001010000100100… |
… | …0100000001000100111 |
3 | 111101201202111011212221 |
4 | 2002201020200020213 |
5 | 4244002413022043 |
6 | 144214104053211 |
7 | 13060600004665 |
oct | 2024110401047 |
9 | 441652434787 |
10 | 140142314023 |
11 | 54485756838 |
12 | 231b1464207 |
13 | 102a51cc68a |
14 | 6ad64b5c35 |
15 | 39a34838ed |
hex | 20a1220227 |
140142314023 has 8 divisors (see below), whose sum is σ = 145003020480. Its totient is φ = 135283488480.
The previous prime is 140142314021. The next prime is 140142314041. The reversal of 140142314023 is 320413241041.
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 140142314023 - 21 = 140142314021 is a prime.
It is a super-2 number, since 2×1401423140232 (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 (140142314021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 317788 + ... + 617473.
It is an arithmetic number, because the mean of its divisors is an integer number (18125377560).
Almost surely, 2140142314023 is an apocalyptic number.
140142314023 is a deficient number, since it is larger than the sum of its proper divisors (4860706457).
140142314023 is an equidigital number, since it uses as much as digits as its factorization.
140142314023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 940457.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 140142314023 its reverse (320413241041), we get a palindrome (460555555064).
The spelling of 140142314023 in words is "one hundred forty billion, one hundred forty-two million, three hundred fourteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •