Base | Representation |
---|---|
bin | 1000001010010100111… |
… | …1110010010000001111 |
3 | 111101220120100122220102 |
4 | 2002211033302100033 |
5 | 4244123100111421 |
6 | 144225011241315 |
7 | 13062365441624 |
oct | 2024517622017 |
9 | 441816318812 |
10 | 140211332111 |
11 | 54510707084 |
12 | 232105a923b |
13 | 102b65b6296 |
14 | 6b0172034b |
15 | 39a956860b |
hex | 20a53f240f |
140211332111 has 8 divisors (see below), whose sum is σ = 141779566704. Its totient is φ = 138646627200.
The previous prime is 140211332039. The next prime is 140211332119. The reversal of 140211332111 is 111233112041.
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 140211332111 - 210 = 140211331087 is a prime.
It is a super-2 number, since 2×1402113321112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140211332119) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 802490 + ... + 961463.
It is an arithmetic number, because the mean of its divisors is an integer number (17722445838).
Almost surely, 2140211332111 is an apocalyptic number.
140211332111 is a deficient number, since it is larger than the sum of its proper divisors (1568234593).
140211332111 is a wasteful number, since it uses less digits than its factorization.
140211332111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1764841.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 140211332111 its reverse (111233112041), we get a palindrome (251444444152).
The spelling of 140211332111 in words is "one hundred forty billion, two hundred eleven million, three hundred thirty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •