Base | Representation |
---|---|
bin | 1000001010010111011… |
… | …1000100111110101111 |
3 | 111101221021201222021202 |
4 | 2002211313010332233 |
5 | 4244133214214211 |
6 | 144230020120115 |
7 | 13062552131666 |
oct | 2024567047657 |
9 | 441837658252 |
10 | 140221632431 |
11 | 54516501941 |
12 | 23213b3603b |
13 | 102b878174a |
14 | 6b02c41ddd |
15 | 39aa40053b |
hex | 20a5dc4faf |
140221632431 has 4 divisors (see below), whose sum is σ = 140833954200. Its totient is φ = 139609310664.
The previous prime is 140221632427. The next prime is 140221632437. The reversal of 140221632431 is 134236122041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 140221632431 - 22 = 140221632427 is a prime.
It is a super-2 number, since 2×1402216324312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140221632394 and 140221632403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140221632437) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 306160541 + ... + 306160998.
It is an arithmetic number, because the mean of its divisors is an integer number (35208488550).
Almost surely, 2140221632431 is an apocalyptic number.
140221632431 is a deficient number, since it is larger than the sum of its proper divisors (612321769).
140221632431 is an equidigital number, since it uses as much as digits as its factorization.
140221632431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 612321768.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 140221632431 its reverse (134236122041), we get a palindrome (274457754472).
The spelling of 140221632431 in words is "one hundred forty billion, two hundred twenty-one million, six hundred thirty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •