Base | Representation |
---|---|
bin | 111111100100011… |
… | …0100110110001001 |
3 | 12111122122122102021 |
4 | 1333020310312021 |
5 | 13332023120131 |
6 | 551354004441 |
7 | 103600241215 |
oct | 17710646611 |
9 | 5448578367 |
10 | 2133020041 |
11 | 9a5041589 |
12 | 4b6416721 |
13 | 27cbac649 |
14 | 163403945 |
15 | c73dae11 |
hex | 7f234d89 |
2133020041 has 2 divisors, whose sum is σ = 2133020042. Its totient is φ = 2133020040.
The previous prime is 2133019997. The next prime is 2133020053. The reversal of 2133020041 is 1400203312.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2082553225 + 50466816 = 45635^2 + 7104^2 .
It is a cyclic number.
It is not a de Polignac number, because 2133020041 - 215 = 2132987273 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2133019997 and 2133020024.
It is not a weakly prime, because it can be changed into another prime (2133020341) 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, 1066510020 + 1066510021.
It is an arithmetic number, because the mean of its divisors is an integer number (1066510021).
Almost surely, 22133020041 is an apocalyptic number.
It is an amenable number.
2133020041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2133020041 is an equidigital number, since it uses as much as digits as its factorization.
2133020041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 2133020041 is about 46184.6299216525. The cubic root of 2133020041 is about 1287.2561596345.
Adding to 2133020041 its reverse (1400203312), we get a palindrome (3533223353).
The spelling of 2133020041 in words is "two billion, one hundred thirty-three million, twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •