Base | Representation |
---|---|
bin | 1100001000010000011… |
… | …1001011001001000001 |
3 | 201220212000010212010101 |
4 | 3002010013023021001 |
5 | 11403222433401421 |
6 | 235420501202401 |
7 | 21024503311612 |
oct | 3020407131101 |
9 | 656760125111 |
10 | 208374903361 |
11 | 8040a223039 |
12 | 34474400401 |
13 | 1685a4276b1 |
14 | a12a499c09 |
15 | 5648827191 |
hex | 30841cb241 |
208374903361 has 27 divisors (see below), whose sum is σ = 221295936099. Its totient is φ = 196191881952.
The previous prime is 208374903329. The next prime is 208374903367. The reversal of 208374903361 is 163309473802.
The square root of 208374903361 is 456481.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 40012400961 + 168362502400 = 200031^2 + 410320^2 .
It is not a de Polignac number, because 208374903361 - 25 = 208374903329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (208374903367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 934416496 + ... + 934416718.
Almost surely, 2208374903361 is an apocalyptic number.
208374903361 is the 456481-st square number.
208374903361 is the 228241-st centered octagonal number.
It is an amenable number.
208374903361 is a deficient number, since it is larger than the sum of its proper divisors (12921032738).
208374903361 is an frugal number, since it uses more digits than its factorization.
208374903361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670 (or 335 counting only the distinct ones).
The product of its (nonzero) digits is 653184, while the sum is 46.
The spelling of 208374903361 in words is "two hundred eight billion, three hundred seventy-four million, nine hundred three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •