Base | Representation |
---|---|
bin | 1000001100100000001… |
… | …1011110100111100000 |
3 | 111110102021012201221000 |
4 | 2003020003132213200 |
5 | 4301322044333022 |
6 | 144402552032000 |
7 | 13113016243005 |
oct | 2031003364740 |
9 | 443367181830 |
10 | 140795308512 |
11 | 54790310201 |
12 | 23354092600 |
13 | 1037a591651 |
14 | 6b590d58ac |
15 | 39e096d6ac |
hex | 20c80de9e0 |
140795308512 has 48 divisors (see below), whose sum is σ = 410652985680. Its totient is φ = 46931769216.
The previous prime is 140795308501. The next prime is 140795308523. The reversal of 140795308512 is 215803597041.
140795308512 is a `hidden beast` number, since 1 + 40 + 7 + 95 + 3 + 0 + 8 + 512 = 666.
It is an interprime number because it is at equal distance from previous prime (140795308501) and next prime (140795308523).
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81477903 + ... + 81479630.
It is an arithmetic number, because the mean of its divisors is an integer number (8555270535).
Almost surely, 2140795308512 is an apocalyptic number.
140795308512 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
140795308512 is an abundant number, since it is smaller than the sum of its proper divisors (269857677168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140795308512 is a wasteful number, since it uses less digits than its factorization.
140795308512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162957552 (or 162957538 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 45.
The spelling of 140795308512 in words is "one hundred forty billion, seven hundred ninety-five million, three hundred eight thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •