Base | Representation |
---|---|
bin | 1000001011000111000… |
… | …1001001001000000000 |
3 | 111102110012122101011202 |
4 | 2002301301021020000 |
5 | 4300040334400021 |
6 | 144301514000332 |
7 | 13100526142610 |
oct | 2026161111000 |
9 | 442405571152 |
10 | 140421403136 |
11 | 546092485a3 |
12 | 2326aa160a8 |
13 | 1031ac88571 |
14 | 6b215a4a40 |
15 | 39bcc11a0b |
hex | 20b1c49200 |
140421403136 has 40 divisors (see below), whose sum is σ = 320649774720. Its totient is φ = 60180599808.
The previous prime is 140421403081. The next prime is 140421403151. The reversal of 140421403136 is 631304124041.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 140421403099 and 140421403108.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 19586456 + ... + 19593623.
It is an arithmetic number, because the mean of its divisors is an integer number (8016244368).
Almost surely, 2140421403136 is an apocalyptic number.
140421403136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
140421403136 is an abundant number, since it is smaller than the sum of its proper divisors (180228371584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140421403136 is an frugal number, since it uses more digits than its factorization.
140421403136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39180104 (or 39180088 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 140421403136 its reverse (631304124041), we get a palindrome (771725527177).
The spelling of 140421403136 in words is "one hundred forty billion, four hundred twenty-one million, four hundred three thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •