Base | Representation |
---|---|
bin | 1000001011111011101… |
… | …1111000000011111000 |
3 | 111110000121100011000020 |
4 | 2002332323320003320 |
5 | 4301013413230012 |
6 | 144335445010440 |
7 | 13106151000132 |
oct | 2027673700370 |
9 | 443017304006 |
10 | 140642320632 |
11 | 54711a18140 |
12 | 233109b3a20 |
13 | 10354987788 |
14 | 6b42a70052 |
15 | 39d22eda8c |
hex | 20beef80f8 |
140642320632 has 32 divisors (see below), whose sum is σ = 383569966080. Its totient is φ = 42618884960.
The previous prime is 140642320613. The next prime is 140642320667. The reversal of 140642320632 is 236023246041.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 140642320593 and 140642320602.
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, 266367768 + ... + 266368295.
It is an arithmetic number, because the mean of its divisors is an integer number (11986561440).
Almost surely, 2140642320632 is an apocalyptic number.
140642320632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
140642320632 is an abundant number, since it is smaller than the sum of its proper divisors (242927645448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140642320632 is a wasteful number, since it uses less digits than its factorization.
140642320632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 532736083 (or 532736079 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 140642320632 its reverse (236023246041), we get a palindrome (376665566673).
The spelling of 140642320632 in words is "one hundred forty billion, six hundred forty-two million, three hundred twenty thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •