Base | Representation |
---|---|
bin | 1000001010011001110… |
… | …0000000010000100111 |
3 | 111101221221221202201222 |
4 | 2002212130000100213 |
5 | 4244143203444143 |
6 | 144231003410555 |
7 | 13063030326356 |
oct | 2024634002047 |
9 | 441857852658 |
10 | 140231312423 |
11 | 54520a13634 |
12 | 23217223a5b |
13 | 102ba790757 |
14 | 6b0424199d |
15 | 39ab1b3768 |
hex | 20a6700427 |
140231312423 has 8 divisors (see below), whose sum is σ = 141695936256. Its totient is φ = 138774297600.
The previous prime is 140231312411. The next prime is 140231312489. The reversal of 140231312423 is 324213132041.
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 140231312423 - 210 = 140231311399 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140231312392 and 140231312401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140231312623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1865198 + ... + 1938923.
It is an arithmetic number, because the mean of its divisors is an integer number (17711992032).
Almost surely, 2140231312423 is an apocalyptic number.
140231312423 is a deficient number, since it is larger than the sum of its proper divisors (1464623833).
140231312423 is a wasteful number, since it uses less digits than its factorization.
140231312423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3804505.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 140231312423 its reverse (324213132041), we get a palindrome (464444444464).
The spelling of 140231312423 in words is "one hundred forty billion, two hundred thirty-one million, three hundred twelve thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •