Base | Representation |
---|---|
bin | 11111111100100011001010… |
… | …010001110001111011110000 |
3 | 200102110200222221002111211210 |
4 | 133330203022101301323300 |
5 | 121403424221121022420 |
6 | 1214452550500440120 |
7 | 41410546664556201 |
oct | 3774431221617360 |
9 | 612420887074753 |
10 | 140500363845360 |
11 | 40849962610092 |
12 | 13911ab36a9040 |
13 | 605218705158c |
14 | 269a37a9835a8 |
15 | 1139b0c0409e0 |
hex | 7fc8ca471ef0 |
140500363845360 has 80 divisors (see below), whose sum is σ = 435751015328640. Its totient is φ = 37449569076480.
The previous prime is 140500363845271. The next prime is 140500363845427. The reversal of 140500363845360 is 63548363005041.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 133808886 + ... + 134854805.
It is an arithmetic number, because the mean of its divisors is an integer number (5446887691608).
Almost surely, 2140500363845360 is an apocalyptic number.
140500363845360 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140500363845360 is an abundant number, since it is smaller than the sum of its proper divisors (295250651483280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140500363845360 is a wasteful number, since it uses less digits than its factorization.
140500363845360 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 268665886 (or 268665880 counting only the distinct ones).
The product of its (nonzero) digits is 3110400, while the sum is 48.
The spelling of 140500363845360 in words is "one hundred forty trillion, five hundred billion, three hundred sixty-three million, eight hundred forty-five thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •