Base | Representation |
---|---|
bin | 10111110110010… |
… | …11110001101001 |
3 | 111221110022100200 |
4 | 23323023301221 |
5 | 402204022410 |
6 | 31504022413 |
7 | 4646342163 |
oct | 1373136151 |
9 | 457408320 |
10 | 200064105 |
11 | a2a2713a |
12 | 57001a09 |
13 | 325aa537 |
14 | 1c7db933 |
15 | 1286d3c0 |
hex | becbc69 |
200064105 has 12 divisors (see below), whose sum is σ = 346777860. Its totient is φ = 106700832.
The previous prime is 200064083. The next prime is 200064107. The reversal of 200064105 is 501460002.
It is a happy number.
200064105 is a `hidden beast` number, since 20 + 0 + 0 + 641 + 0 + 5 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 103002201 + 97061904 = 10149^2 + 9852^2 .
It is not a de Polignac number, because 200064105 - 210 = 200063081 is a prime.
It is a super-2 number, since 2×2000641052 = 80051292218902050, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200064107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2222890 + ... + 2222979.
It is an arithmetic number, because the mean of its divisors is an integer number (28898155).
Almost surely, 2200064105 is an apocalyptic number.
It is an amenable number.
200064105 is a deficient number, since it is larger than the sum of its proper divisors (146713755).
200064105 is a wasteful number, since it uses less digits than its factorization.
200064105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4445880 (or 4445877 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 200064105 is about 14144.4018961567. The cubic root of 200064105 is about 584.8660223538.
The spelling of 200064105 in words is "two hundred million, sixty-four thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •