Base | Representation |
---|---|
bin | 101101101100111011110110… |
… | …010100001010101100010001 |
3 | 222100200102011102122010222112 |
4 | 231230323312110022230101 |
5 | 202321141011033000032 |
6 | 1551254044125115105 |
7 | 60223525450133156 |
oct | 5554736624125421 |
9 | 870612142563875 |
10 | 201000012000017 |
11 | 5905469879500a |
12 | 1a6631953b8a95 |
13 | 88202b1b99709 |
14 | 378c6498b222d |
15 | 18387118c61b2 |
hex | b6cef650ab11 |
201000012000017 has 2 divisors, whose sum is σ = 201000012000018. Its totient is φ = 201000012000016.
The previous prime is 201000011999989. The next prime is 201000012000079. The reversal of 201000012000017 is 710000210000102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 194912620354321 + 6087391645696 = 13961111^2 + 2467264^2 .
It is a cyclic number.
It is not a de Polignac number, because 201000012000017 - 214 = 201000011983633 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201000011999965 and 201000012000010.
It is not a weakly prime, because it can be changed into another prime (201000012003017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500006000008 + 100500006000009.
It is an arithmetic number, because the mean of its divisors is an integer number (100500006000009).
Almost surely, 2201000012000017 is an apocalyptic number.
It is an amenable number.
201000012000017 is a deficient number, since it is larger than the sum of its proper divisors (1).
201000012000017 is an equidigital number, since it uses as much as digits as its factorization.
201000012000017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 14.
Adding to 201000012000017 its reverse (710000210000102), we get a palindrome (911000222000119).
The spelling of 201000012000017 in words is "two hundred one trillion, twelve million, seventeen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •