Base | Representation |
---|---|
bin | 10111110111110… |
… | …01010110110001 |
3 | 111221210210110100 |
4 | 23323321112301 |
5 | 402231011201 |
6 | 31512023013 |
7 | 4651050402 |
oct | 1373712661 |
9 | 457723410 |
10 | 200250801 |
11 | a3044433 |
12 | 57091a69 |
13 | 326444ca |
14 | 1c8499a9 |
15 | 128a8886 |
hex | bef95b1 |
200250801 has 27 divisors (see below), whose sum is σ = 298161409. Its totient is φ = 129509952.
The previous prime is 200250761. The next prime is 200250851. The reversal of 200250801 is 108052002.
The square root of 200250801 is 14151.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 2117025 + 198133776 = 1455^2 + 14076^2 .
It is not a de Polignac number, because 200250801 - 211 = 200248753 is a prime.
It is a super-2 number, since 2×2002508012 = 80200766602283202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200250851) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 2249965 + ... + 2250053.
Almost surely, 2200250801 is an apocalyptic number.
200250801 is the 14151-st square number.
200250801 is the 7076-th centered octagonal number.
It is an amenable number.
200250801 is a deficient number, since it is larger than the sum of its proper divisors (97910608).
200250801 is an frugal number, since it uses more digits than its factorization.
200250801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290 (or 145 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The cubic root of 200250801 is about 585.0478943913.
It can be divided in two parts, 200 and 250801, that added together give a square (251001 = 5012).
The spelling of 200250801 in words is "two hundred million, two hundred fifty thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •