Base | Representation |
---|---|
bin | 1000001011000111100… |
… | …0000001000010011101 |
3 | 111102110100000220220020 |
4 | 2002301320001002131 |
5 | 4300041320030041 |
6 | 144302020342353 |
7 | 13100550356121 |
oct | 2026170010235 |
9 | 442410026806 |
10 | 140423205021 |
11 | 5460a269360 |
12 | 2326b5449b9 |
13 | 1031b469778 |
14 | 6b21913581 |
15 | 39bce6a866 |
hex | 20b1e0109d |
140423205021 has 32 divisors (see below), whose sum is σ = 204836726400. Its totient is φ = 84861665280.
The previous prime is 140423204927. The next prime is 140423205031. The reversal of 140423205021 is 120502324041.
It is not a de Polignac number, because 140423205021 - 214 = 140423188637 is a prime.
It is a super-2 number, since 2×1404232050212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140423204982 and 140423205000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140423205031) 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, 19208715 + ... + 19216023.
It is an arithmetic number, because the mean of its divisors is an integer number (6401147700).
Almost surely, 2140423205021 is an apocalyptic number.
140423205021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
140423205021 is a deficient number, since it is larger than the sum of its proper divisors (64413521379).
140423205021 is a wasteful number, since it uses less digits than its factorization.
140423205021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8909.
The product of its (nonzero) digits is 1920, while the sum is 24.
Adding to 140423205021 its reverse (120502324041), we get a palindrome (260925529062).
The spelling of 140423205021 in words is "one hundred forty billion, four hundred twenty-three million, two hundred five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •