Base | Representation |
---|---|
bin | 1000001010000100100… |
… | …0110111110101110011 |
3 | 111101201202200010002020 |
4 | 2002201020313311303 |
5 | 4244002424123443 |
6 | 144214110122523 |
7 | 13060600561041 |
oct | 2024110676563 |
9 | 441652603066 |
10 | 140142411123 |
11 | 54485812790 |
12 | 231b14b0443 |
13 | 102a5234930 |
14 | 6ad64dd391 |
15 | 39a34a2583 |
hex | 20a1237d73 |
140142411123 has 32 divisors (see below), whose sum is σ = 219574102272. Its totient is φ = 78383376000.
The previous prime is 140142411023. The next prime is 140142411133. The reversal of 140142411123 is 321114241041.
It is a happy number.
It is not a de Polignac number, because 140142411123 - 217 = 140142280051 is a prime.
It is a super-2 number, since 2×1401424111232 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140142411093 and 140142411102.
It is not an unprimeable number, because it can be changed into a prime (140142411133) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1960161 + ... + 2030397.
It is an arithmetic number, because the mean of its divisors is an integer number (6861690696).
Almost surely, 2140142411123 is an apocalyptic number.
140142411123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
140142411123 is a deficient number, since it is larger than the sum of its proper divisors (79431691149).
140142411123 is a wasteful number, since it uses less digits than its factorization.
140142411123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74915.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 140142411123 its reverse (321114241041), we get a palindrome (461256652164).
The spelling of 140142411123 in words is "one hundred forty billion, one hundred forty-two million, four hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •