Base | Representation |
---|---|
bin | 101101101110011001111010… |
… | …010001000000001110001001 |
3 | 222101001001212011012200221121 |
4 | 231232121322101000032021 |
5 | 202324314332030323032 |
6 | 1551412310103035241 |
7 | 60234032333066554 |
oct | 5556317221001611 |
9 | 871031764180847 |
10 | 201101010011017 |
11 | 59093506505596 |
12 | 1a67a88143bb21 |
13 | 882998939abbc |
14 | 37934ab2c369b |
15 | 183b17354ca97 |
hex | b6e67a440389 |
201101010011017 has 2 divisors, whose sum is σ = 201101010011018. Its totient is φ = 201101010011016.
The previous prime is 201101010010883. The next prime is 201101010011063. The reversal of 201101010011017 is 710110010101102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 195087033630736 + 6013976380281 = 13967356^2 + 2452341^2 .
It is a cyclic number.
It is not a de Polignac number, because 201101010011017 - 243 = 192304916988809 is a prime.
It is a super-2 number, since 2×2011010100110172 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201101010011117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100550505005508 + 100550505005509.
It is an arithmetic number, because the mean of its divisors is an integer number (100550505005509).
Almost surely, 2201101010011017 is an apocalyptic number.
It is an amenable number.
201101010011017 is a deficient number, since it is larger than the sum of its proper divisors (1).
201101010011017 is an equidigital number, since it uses as much as digits as its factorization.
201101010011017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14, while the sum is 16.
Adding to 201101010011017 its reverse (710110010101102), we get a palindrome (911211020112119).
The spelling of 201101010011017 in words is "two hundred one trillion, one hundred one billion, ten million, eleven thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •