Base | Representation |
---|---|
bin | 1000001010010111001… |
… | …1101100101100011000 |
3 | 111101221020001222001020 |
4 | 2002211303230230120 |
5 | 4244133002342040 |
6 | 144225545122440 |
7 | 13062541452111 |
oct | 2024563545430 |
9 | 441836058036 |
10 | 140220746520 |
11 | 54515a57288 |
12 | 23213789420 |
13 | 102b853143a |
14 | 6b02a91208 |
15 | 39aa2c7cd0 |
hex | 20a5cecb18 |
140220746520 has 32 divisors (see below), whose sum is σ = 420662239920. Its totient is φ = 37392199040.
The previous prime is 140220746489. The next prime is 140220746527. The reversal of 140220746520 is 25647022041.
It is a super-2 number, since 2×1402207465202 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140220746527) 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 7 ways as a sum of consecutive naturals, for example, 584252991 + ... + 584253230.
Almost surely, 2140220746520 is an apocalyptic number.
140220746520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140220746520 is an abundant number, since it is smaller than the sum of its proper divisors (280441493400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140220746520 is a wasteful number, since it uses less digits than its factorization.
140220746520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1168506235 (or 1168506231 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 33.
Adding to 140220746520 its reverse (25647022041), we get a palindrome (165867768561).
The spelling of 140220746520 in words is "one hundred forty billion, two hundred twenty million, seven hundred forty-six thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •