Base | Representation |
---|---|
bin | 101101100001011100000101… |
… | …111111010111011010111111 |
3 | 222020212220000012120012002221 |
4 | 231201130011333113122333 |
5 | 202220220040224001002 |
6 | 1545451112115430211 |
7 | 60112460315340346 |
oct | 5541340577273277 |
9 | 866786005505087 |
10 | 200210001000127 |
11 | 5887a648111a08 |
12 | 1a5560582b5367 |
13 | 87939505587c1 |
14 | 3762304048b5d |
15 | 1822dc551cc37 |
hex | b61705fd76bf |
200210001000127 has 2 divisors, whose sum is σ = 200210001000128. Its totient is φ = 200210001000126.
The previous prime is 200210001000047. The next prime is 200210001000133. The reversal of 200210001000127 is 721000100012002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200210001000127 - 227 = 200209866782399 is a prime.
It is a super-2 number, since 2×2002100010001272 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 200210001000127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210001004127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105000500063 + 100105000500064.
It is an arithmetic number, because the mean of its divisors is an integer number (100105000500064).
Almost surely, 2200210001000127 is an apocalyptic number.
200210001000127 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210001000127 is an equidigital number, since it uses as much as digits as its factorization.
200210001000127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 16.
Adding to 200210001000127 its reverse (721000100012002), we get a palindrome (921210101012129).
The spelling of 200210001000127 in words is "two hundred trillion, two hundred ten billion, one million, one hundred twenty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •