Base | Representation |
---|---|
bin | 111011101110010… |
… | …101011001111001 |
3 | 2120211102222101201 |
4 | 323232111121321 |
5 | 4023003031131 |
6 | 243232214201 |
7 | 33554606515 |
oct | 7356253171 |
9 | 2524388351 |
10 | 1002002041 |
11 | 474670a67 |
12 | 23b69a361 |
13 | 12c78b521 |
14 | 9710d145 |
15 | 5ce79761 |
hex | 3bb95679 |
1002002041 has 2 divisors, whose sum is σ = 1002002042. Its totient is φ = 1002002040.
The previous prime is 1002002033. The next prime is 1002002051. The reversal of 1002002041 is 1402002001.
It is an a-pointer prime, because the next prime (1002002051) can be obtained adding 1002002041 to its sum of digits (10).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 534534400 + 467467641 = 23120^2 + 21621^2 .
It is a cyclic number.
It is not a de Polignac number, because 1002002041 - 23 = 1002002033 is a prime.
It is not a weakly prime, because it can be changed into another prime (1002002021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501001020 + 501001021.
It is an arithmetic number, because the mean of its divisors is an integer number (501001021).
Almost surely, 21002002041 is an apocalyptic number.
It is an amenable number.
1002002041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002002041 is an equidigital number, since it uses as much as digits as its factorization.
1002002041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 10.
The square root of 1002002041 is about 31654.4158214932. The cubic root of 1002002041 is about 1000.6669021427. Note that the first 3 decimals are identical.
Adding to 1002002041 its reverse (1402002001), we get a palindrome (2404004042).
The spelling of 1002002041 in words is "one billion, two million, two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •