Base | Representation |
---|---|
bin | 101101101100111100111101… |
… | …001000110010110100111001 |
3 | 222100200112020020110000022222 |
4 | 231230330331020302310321 |
5 | 202321200424222413032 |
6 | 1551254402052253425 |
7 | 60223600055520056 |
oct | 5554747510626471 |
9 | 870615206400288 |
10 | 201001200201017 |
11 | 59055148472007 |
12 | 1a663467311275 |
13 | 88204410bc528 |
14 | 378c71d61002d |
15 | 1838780d80a12 |
hex | b6cf3d232d39 |
201001200201017 has 2 divisors, whose sum is σ = 201001200201018. Its totient is φ = 201001200201016.
The previous prime is 201001200200963. The next prime is 201001200201037. The reversal of 201001200201017 is 710102002100102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 190082775276601 + 10918424924416 = 13787051^2 + 3304304^2 .
It is a cyclic number.
It is not a de Polignac number, because 201001200201017 - 28 = 201001200200761 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201001200200986 and 201001200201004.
It is not a weakly prime, because it can be changed into another prime (201001200201037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500600100508 + 100500600100509.
It is an arithmetic number, because the mean of its divisors is an integer number (100500600100509).
Almost surely, 2201001200201017 is an apocalyptic number.
It is an amenable number.
201001200201017 is a deficient number, since it is larger than the sum of its proper divisors (1).
201001200201017 is an equidigital number, since it uses as much as digits as its factorization.
201001200201017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 201001200201017 its reverse (710102002100102), we get a palindrome (911103202301119).
The spelling of 201001200201017 in words is "two hundred one trillion, one billion, two hundred million, two hundred one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •