Base | Representation |
---|---|
bin | 1100000011000111001… |
… | …1101011011101100100 |
3 | 201210021202211210201111 |
4 | 3000301303223131210 |
5 | 11342410434424111 |
6 | 235031453034404 |
7 | 20645335326601 |
oct | 3006163533544 |
9 | 653252753644 |
10 | 206994061156 |
11 | 7a870829933 |
12 | 34149a85a04 |
13 | 1669a325bbc |
14 | a038d336a8 |
15 | 55b74b8a21 |
hex | 3031ceb764 |
206994061156 has 27 divisors (see below), whose sum is σ = 365768655609. Its totient is φ = 102498380208.
The previous prime is 206994061139. The next prime is 206994061189. The reversal of 206994061156 is 651160499602.
The square root of 206994061156 is 454966.
It is a perfect power (a square), and thus also a powerful number.
206994061156 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 144273867556 + 62720193600 = 379834^2 + 250440^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 99181545 + ... + 99183631.
Almost surely, 2206994061156 is an apocalyptic number.
206994061156 is the 454966-th square number.
It is an amenable number.
206994061156 is a deficient number, since it is larger than the sum of its proper divisors (158774594453).
206994061156 is an frugal number, since it uses more digits than its factorization.
206994061156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4396 (or 2198 counting only the distinct ones).
The product of its (nonzero) digits is 699840, while the sum is 49.
Multiplying 206994061156 by its sum of digits (49), we get a square (10142708996644 = 31847622).
The spelling of 206994061156 in words is "two hundred six billion, nine hundred ninety-four million, sixty-one thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •