Base | Representation |
---|---|
bin | 111011100110111… |
… | …0100001000111101 |
3 | 12011101120010022101 |
4 | 1313031310020331 |
5 | 13044012011031 |
6 | 530245145101 |
7 | 100364440621 |
oct | 16715641075 |
9 | 5141503271 |
10 | 2000110141 |
11 | 937012397 |
12 | 4799bb191 |
13 | 25b4b5533 |
14 | 14d8c7181 |
15 | ba8d5361 |
hex | 7737423d |
2000110141 has 4 divisors (see below), whose sum is σ = 2007177952. Its totient is φ = 1993042332.
The previous prime is 2000110117. The next prime is 2000110157. The reversal of 2000110141 is 1410110002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2000110141 - 213 = 2000101949 is a prime.
It is a super-2 number, since 2×20001101412 = 8000881152262079762, which 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 (2000110181) 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, 3533481 + ... + 3534046.
It is an arithmetic number, because the mean of its divisors is an integer number (501794488).
Almost surely, 22000110141 is an apocalyptic number.
It is an amenable number.
2000110141 is a deficient number, since it is larger than the sum of its proper divisors (7067811).
2000110141 is an equidigital number, since it uses as much as digits as its factorization.
2000110141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7067810.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 2000110141 is about 44722.5909468582. The cubic root of 2000110141 is about 1259.9441776311.
Adding to 2000110141 its reverse (1410110002), we get a palindrome (3410220143).
The spelling of 2000110141 in words is "two billion, one hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •