Base | Representation |
---|---|
bin | 11111111011100101101010… |
… | …100010111110010011100111 |
3 | 200102020101120010211201110122 |
4 | 133323211222202332103213 |
5 | 121401334003301332221 |
6 | 1214402350403312155 |
7 | 41403021456603341 |
oct | 3773455242762347 |
9 | 612211503751418 |
10 | 140434333230311 |
11 | 40823958aa174a |
12 | 1390114607b65b |
13 | 6048b93099723 |
14 | 26970b51d2291 |
15 | 1138045158eab |
hex | 7fb96a8be4e7 |
140434333230311 has 8 divisors (see below), whose sum is σ = 142530776634480. Its totient is φ = 138337901843328.
The previous prime is 140434333230307. The next prime is 140434333230379. The reversal of 140434333230311 is 113032333434041.
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 140434333230311 - 22 = 140434333230307 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 (140434333232311) 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, 22096085 + ... + 27732753.
It is an arithmetic number, because the mean of its divisors is an integer number (17816347079310).
Almost surely, 2140434333230311 is an apocalyptic number.
140434333230311 is a deficient number, since it is larger than the sum of its proper divisors (2096443404169).
140434333230311 is an equidigital number, since it uses as much as digits as its factorization.
140434333230311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6008593.
The product of its (nonzero) digits is 93312, while the sum is 35.
Adding to 140434333230311 its reverse (113032333434041), we get a palindrome (253466666664352).
The spelling of 140434333230311 in words is "one hundred forty trillion, four hundred thirty-four billion, three hundred thirty-three million, two hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •