Base | Representation |
---|---|
bin | 1000001011011010010… |
… | …1000110011000101110 |
3 | 111102122211112211201200 |
4 | 2002312211012120232 |
5 | 4300222021213040 |
6 | 144313520150330 |
7 | 13102526263533 |
oct | 2026645063056 |
9 | 442584484650 |
10 | 140502132270 |
11 | 5464a877595 |
12 | 23291a683a6 |
13 | 10331912796 |
14 | 6b2c1bad8a |
15 | 39c4d5b630 |
hex | 20b694662e |
140502132270 has 48 divisors (see below), whose sum is σ = 386794109520. Its totient is φ = 35263279872.
The previous prime is 140502132259. The next prime is 140502132359. The reversal of 140502132270 is 72231205041.
140502132270 is a `hidden beast` number, since 1 + 4 + 0 + 502 + 132 + 27 + 0 = 666.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 45914200 + ... + 45917259.
It is an arithmetic number, because the mean of its divisors is an integer number (8058210615).
Almost surely, 2140502132270 is an apocalyptic number.
140502132270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140502132270 is an abundant number, since it is smaller than the sum of its proper divisors (246291977250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140502132270 is a wasteful number, since it uses less digits than its factorization.
140502132270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91831489 (or 91831486 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The spelling of 140502132270 in words is "one hundred forty billion, five hundred two million, one hundred thirty-two thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •