Base | Representation |
---|---|
bin | 1000001010010010001… |
… | …1100010000111011001 |
3 | 111101212202112022002120 |
4 | 2002210203202013121 |
5 | 4244112112403143 |
6 | 144223514451453 |
7 | 13062165025251 |
oct | 2024443420731 |
9 | 441782468076 |
10 | 140199731673 |
11 | 54505103541 |
12 | 23208733b89 |
13 | 102b4084111 |
14 | 6addd80961 |
15 | 39a8526383 |
hex | 20a48e21d9 |
140199731673 has 8 divisors (see below), whose sum is σ = 187338471936. Its totient is φ = 93263739600.
The previous prime is 140199731671. The next prime is 140199731689. The reversal of 140199731673 is 376137991041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140199731673 - 21 = 140199731671 is a prime.
It is a super-2 number, since 2×1401997316732 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (140199731671) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50685433 + ... + 50688198.
It is an arithmetic number, because the mean of its divisors is an integer number (23417308992).
Almost surely, 2140199731673 is an apocalyptic number.
It is an amenable number.
140199731673 is a deficient number, since it is larger than the sum of its proper divisors (47138740263).
140199731673 is a wasteful number, since it uses less digits than its factorization.
140199731673 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101374095.
The product of its (nonzero) digits is 857304, while the sum is 51.
The spelling of 140199731673 in words is "one hundred forty billion, one hundred ninety-nine million, seven hundred thirty-one thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •