Base | Representation |
---|---|
bin | 11101010000010101011… |
… | …01011001011110101111 |
3 | 10120002121020221102202111 |
4 | 32220022231121132233 |
5 | 112432123204122041 |
6 | 2045441115504451 |
7 | 132423562123621 |
oct | 16501255313657 |
9 | 3502536842674 |
10 | 1005202020271 |
11 | 3583383757a9 |
12 | 142994158127 |
13 | 73a36c3b147 |
14 | 3691b294c11 |
15 | 1b2332c5981 |
hex | ea0ab597af |
1005202020271 has 2 divisors, whose sum is σ = 1005202020272. Its totient is φ = 1005202020270.
The previous prime is 1005202020257. The next prime is 1005202020293. The reversal of 1005202020271 is 1720202025001.
It is an a-pointer prime, because the next prime (1005202020293) can be obtained adding 1005202020271 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1005202020271 - 229 = 1004665149359 is a prime.
It is a super-2 number, since 2×10052020202712 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1005202023271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 502601010135 + 502601010136.
It is an arithmetic number, because the mean of its divisors is an integer number (502601010136).
Almost surely, 21005202020271 is an apocalyptic number.
1005202020271 is a deficient number, since it is larger than the sum of its proper divisors (1).
1005202020271 is an equidigital number, since it uses as much as digits as its factorization.
1005202020271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 22.
Adding to 1005202020271 its reverse (1720202025001), we get a palindrome (2725404045272).
The spelling of 1005202020271 in words is "one trillion, five billion, two hundred two million, twenty thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •