Base | Representation |
---|---|
bin | 11111111000110000101100… |
… | …101001111100110010111101 |
3 | 200101112211000012202010021011 |
4 | 133320300230221330302331 |
5 | 121340143030430442141 |
6 | 1214133213145235221 |
7 | 41353002315036436 |
oct | 3770605451746275 |
9 | 611484005663234 |
10 | 140240021343421 |
11 | 40759505aa907a |
12 | 1388b557492b11 |
13 | 6033767345b6c |
14 | 268b92073448d |
15 | 1132e71261881 |
hex | 7f8c2ca7ccbd |
140240021343421 has 8 divisors (see below), whose sum is σ = 140336190286560. Its totient is φ = 140143870589328.
The previous prime is 140240021343413. The next prime is 140240021343437. The reversal of 140240021343421 is 124343120042041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 140240021343421 - 23 = 140240021343413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140240021341421) 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, 10896270 + ... + 19980208.
It is an arithmetic number, because the mean of its divisors is an integer number (17542023785820).
Almost surely, 2140240021343421 is an apocalyptic number.
It is an amenable number.
140240021343421 is a deficient number, since it is larger than the sum of its proper divisors (96168943139).
140240021343421 is an equidigital number, since it uses as much as digits as its factorization.
140240021343421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9094523.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 140240021343421 its reverse (124343120042041), we get a palindrome (264583141385462).
The spelling of 140240021343421 in words is "one hundred forty trillion, two hundred forty billion, twenty-one million, three hundred forty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •