Base | Representation |
---|---|
bin | 1000001010011100000… |
… | …0001011111111000000 |
3 | 111101222121210200000000 |
4 | 2002213000023333000 |
5 | 4244203121011012 |
6 | 144231543000000 |
7 | 13063204053135 |
oct | 2024700137700 |
9 | 441877720000 |
10 | 140240797632 |
11 | 54526301a51 |
12 | 2321a439000 |
13 | 102bc731bc0 |
14 | 6b055d058c |
15 | 39abe38ddc |
hex | 20a700bfc0 |
140240797632 has 504 divisors, whose sum is σ = 469487499936. Its totient is φ = 41237932032.
The previous prime is 140240797621. The next prime is 140240797633. The reversal of 140240797632 is 236797042041.
140240797632 is a `hidden beast` number, since 1 + 4 + 0 + 2 + 4 + 0 + 7 + 9 + 7 + 632 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140240797633) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 125550738 + ... + 125551854.
Almost surely, 2140240797632 is an apocalyptic number.
140240797632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 140240797632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (234743749968).
140240797632 is an abundant number, since it is smaller than the sum of its proper divisors (329246702304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140240797632 is an equidigital number, since it uses as much as digits as its factorization.
140240797632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1189 (or 1158 counting only the distinct ones).
The product of its (nonzero) digits is 508032, while the sum is 45.
The spelling of 140240797632 in words is "one hundred forty billion, two hundred forty million, seven hundred ninety-seven thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •