Base | Representation |
---|---|
bin | 10111111101100… |
… | …00110100101001 |
3 | 112000012222021221 |
4 | 23332300310221 |
5 | 402424033111 |
6 | 31540102041 |
7 | 4660330324 |
oct | 1376606451 |
9 | 460188257 |
10 | 201002281 |
11 | a3507a97 |
12 | 57394921 |
13 | 3284857c |
14 | 1c9a37bb |
15 | 129a6371 |
hex | bfb0d29 |
201002281 has 2 divisors, whose sum is σ = 201002282. Its totient is φ = 201002280.
The previous prime is 201002279. The next prime is 201002297. The reversal of 201002281 is 182200102.
It is an a-pointer prime, because the next prime (201002297) can be obtained adding 201002281 to its sum of digits (16).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 118483225 + 82519056 = 10885^2 + 9084^2 .
It is a cyclic number.
It is not a de Polignac number, because 201002281 - 21 = 201002279 is a prime.
It is a super-2 number, since 2×2010022812 = 80803833934405922, which contains 22 as substring.
Together with 201002279, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (231002281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100501140 + 100501141.
It is an arithmetic number, because the mean of its divisors is an integer number (100501141).
Almost surely, 2201002281 is an apocalyptic number.
It is an amenable number.
201002281 is a deficient number, since it is larger than the sum of its proper divisors (1).
201002281 is an equidigital number, since it uses as much as digits as its factorization.
201002281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 16.
The square root of 201002281 is about 14177.5273231971. The cubic root of 201002281 is about 585.7788161048.
Adding to 201002281 its reverse (182200102), we get a palindrome (383202383).
The spelling of 201002281 in words is "two hundred one million, two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •