Base | Representation |
---|---|
bin | 1000001001100010110… |
… | …1110110101111100011 |
3 | 111101100220210022202202 |
4 | 2002120231312233203 |
5 | 4243210241023021 |
6 | 144152101403415 |
7 | 13054233544256 |
oct | 2023055665743 |
9 | 441326708682 |
10 | 140001111011 |
11 | 54412a82933 |
12 | 2317210956b |
13 | 10281b908b8 |
14 | 6ac183b09d |
15 | 3995d90a0b |
hex | 2098b76be3 |
140001111011 has 4 divisors (see below), whose sum is σ = 140002053912. Its totient is φ = 140000168112.
The previous prime is 140001110989. The next prime is 140001111037. The reversal of 140001111011 is 110111100041.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 140001111011 - 26 = 140001110947 is a prime.
It is a super-2 number, since 2×1400011110112 (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 = 140001110983 and 140001111001.
It is not an unprimeable number, because it can be changed into a prime (140001111071) 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, 194501 + ... + 563766.
It is an arithmetic number, because the mean of its divisors is an integer number (35000513478).
Almost surely, 2140001111011 is an apocalyptic number.
140001111011 is a deficient number, since it is larger than the sum of its proper divisors (942901).
140001111011 is an equidigital number, since it uses as much as digits as its factorization.
140001111011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 942900.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 140001111011 its reverse (110111100041), we get a palindrome (250112211052).
The spelling of 140001111011 in words is "one hundred forty billion, one million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •