Base | Representation |
---|---|
bin | 11101001010111000000… |
… | …01100010101110110001 |
3 | 10112211001000020211012202 |
4 | 32211130001202232301 |
5 | 112410122422210431 |
6 | 2044234224032545 |
7 | 132261134245436 |
oct | 16453401425661 |
9 | 3484030224182 |
10 | 1002271288241 |
11 | 357074016413 |
12 | 1422b6762755 |
13 | 7368a9ca192 |
14 | 3671dd5db8d |
15 | 1b110d658cb |
hex | e95c062bb1 |
1002271288241 has 2 divisors, whose sum is σ = 1002271288242. Its totient is φ = 1002271288240.
The previous prime is 1002271288211. The next prime is 1002271288247. The reversal of 1002271288241 is 1428821722001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1002271288225 + 16 = 1001135^2 + 4^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1002271288241 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1002271288195 and 1002271288204.
It is not a weakly prime, because it can be changed into another prime (1002271288247) 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, 501135644120 + 501135644121.
It is an arithmetic number, because the mean of its divisors is an integer number (501135644121).
Almost surely, 21002271288241 is an apocalyptic number.
It is an amenable number.
1002271288241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002271288241 is an equidigital number, since it uses as much as digits as its factorization.
1002271288241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28672, while the sum is 38.
The spelling of 1002271288241 in words is "one trillion, two billion, two hundred seventy-one million, two hundred eighty-eight thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •