Base | Representation |
---|---|
bin | 1000001011110011111… |
… | …0001011000100110000 |
3 | 111102221022100000000000 |
4 | 2002330332023010300 |
5 | 4300431444241433 |
6 | 144332310430000 |
7 | 13105300624320 |
oct | 2027476130460 |
9 | 442838300000 |
10 | 140609368368 |
11 | 546a5360667 |
12 | 23301962300 |
13 | 1034abbaab1 |
14 | 6b3c533280 |
15 | 39ce490113 |
hex | 20bcf8b130 |
140609368368 has 480 divisors, whose sum is σ = 492921228800. Its totient is φ = 37957641984.
The previous prime is 140609368357. The next prime is 140609368391. The reversal of 140609368368 is 863863906041.
It is a Harshad number since it is a multiple of its sum of digits (54).
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 95 ways as a sum of consecutive naturals, for example, 376968630 + ... + 376969002.
Almost surely, 2140609368368 is an apocalyptic number.
140609368368 is a gapful number since it is divisible by the number (18) 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 140609368368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (246460614400).
140609368368 is an abundant number, since it is smaller than the sum of its proper divisors (352311860432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140609368368 is an frugal number, since it uses more digits than its factorization.
140609368368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440 (or 404 counting only the distinct ones).
The product of its (nonzero) digits is 4478976, while the sum is 54.
The spelling of 140609368368 in words is "one hundred forty billion, six hundred nine million, three hundred sixty-eight thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •