Base | Representation |
---|---|
bin | 111100110011011… |
… | …0000101110010101 |
3 | 12021012000002222211 |
4 | 1321212300232111 |
5 | 13134243013211 |
6 | 534240353421 |
7 | 101362310101 |
oct | 17146605625 |
9 | 5235002884 |
10 | 2040204181 |
11 | 957707664 |
12 | 48b315871 |
13 | 2668b2b12 |
14 | 154d62901 |
15 | be1a4e21 |
hex | 799b0b95 |
2040204181 has 2 divisors, whose sum is σ = 2040204182. Its totient is φ = 2040204180.
The previous prime is 2040204163. The next prime is 2040204233. The reversal of 2040204181 is 1814020402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1983277156 + 56927025 = 44534^2 + 7545^2 .
It is a cyclic number.
It is not a de Polignac number, because 2040204181 - 217 = 2040073109 is a prime.
It is a super-2 number, since 2×20402041812 = 8324866200339761522, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2040207181) 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 as a sum of consecutive naturals, namely, 1020102090 + 1020102091.
It is an arithmetic number, because the mean of its divisors is an integer number (1020102091).
Almost surely, 22040204181 is an apocalyptic number.
It is an amenable number.
2040204181 is a deficient number, since it is larger than the sum of its proper divisors (1).
2040204181 is an equidigital number, since it uses as much as digits as its factorization.
2040204181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 22.
The square root of 2040204181 is about 45168.6194276513. The cubic root of 2040204181 is about 1268.3074526792.
Adding to 2040204181 its reverse (1814020402), we get a palindrome (3854224583).
The spelling of 2040204181 in words is "two billion, forty million, two hundred four thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •