Base | Representation |
---|---|
bin | 111011101010110… |
… | …0001010101101001 |
3 | 12011112100202102101 |
4 | 1313111201111221 |
5 | 13100021132111 |
6 | 530400333401 |
7 | 100420553344 |
oct | 16725412551 |
9 | 5145322371 |
10 | 2002130281 |
11 | 938172128 |
12 | 47a614261 |
13 | 25ba41b98 |
14 | 14dc9145b |
15 | bab83bc1 |
hex | 77561569 |
2002130281 has 2 divisors, whose sum is σ = 2002130282. Its totient is φ = 2002130280.
The previous prime is 2002130231. The next prime is 2002130303. The reversal of 2002130281 is 1820312002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1937408256 + 64722025 = 44016^2 + 8045^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002130281 - 221 = 2000033129 is a prime.
It is a super-2 number, since 2×20021302812 = 8017051324194277922, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2002130201) 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, 1001065140 + 1001065141.
It is an arithmetic number, because the mean of its divisors is an integer number (1001065141).
Almost surely, 22002130281 is an apocalyptic number.
It is an amenable number.
2002130281 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002130281 is an equidigital number, since it uses as much as digits as its factorization.
2002130281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 2002130281 is about 44745.1704768235. The cubic root of 2002130281 is about 1260.3682221444.
Adding to 2002130281 its reverse (1820312002), we get a palindrome (3822442283).
The spelling of 2002130281 in words is "two billion, two million, one hundred thirty thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •