Base | Representation |
---|---|
bin | 1100010010001100010… |
… | …1011000001110111001 |
3 | 202011201212202220200021 |
4 | 3010203011120032321 |
5 | 11424203223310131 |
6 | 240541254410441 |
7 | 21150550326052 |
oct | 3044305301671 |
9 | 664655686607 |
10 | 211042010041 |
11 | 81558792835 |
12 | 34a99660a21 |
13 | 16b93b65225 |
14 | a3007a9729 |
15 | 5752a60e11 |
hex | 31231583b9 |
211042010041 has 8 divisors (see below), whose sum is σ = 220620354624. Its totient is φ = 201497215920.
The previous prime is 211042010027. The next prime is 211042010131. The reversal of 211042010041 is 140010240112.
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 211042010041 - 211 = 211042007993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211042009997 and 211042010024.
It is not an unprimeable number, because it can be changed into a prime (211042017041) 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, 8374750 + ... + 8399911.
It is an arithmetic number, because the mean of its divisors is an integer number (27577544328).
Almost surely, 2211042010041 is an apocalyptic number.
It is an amenable number.
211042010041 is a deficient number, since it is larger than the sum of its proper divisors (9578344583).
211042010041 is a wasteful number, since it uses less digits than its factorization.
211042010041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16775231.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 211042010041 its reverse (140010240112), we get a palindrome (351052250153).
The spelling of 211042010041 in words is "two hundred eleven billion, forty-two million, ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •