Base | Representation |
---|---|
bin | 1011101100000011111… |
… | …0101100101011000100 |
3 | 201012022112012200222221 |
4 | 2323000332230223010 |
5 | 11242222334010441 |
6 | 232125444502124 |
7 | 20336110112644 |
oct | 2730076545304 |
9 | 635275180887 |
10 | 200806156996 |
11 | 78185927955 |
12 | 32b016aa944 |
13 | 15c22349653 |
14 | 9a0d1b0524 |
15 | 53541158d1 |
hex | 2ec0facac4 |
200806156996 has 9 divisors (see below), whose sum is σ = 351412343149. Its totient is φ = 100402630384.
The previous prime is 200806156979. The next prime is 200806157003. The reversal of 200806156996 is 699651608002.
The square root of 200806156996 is 448114.
It is a perfect power (a square), and thus also a powerful number.
200806156996 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., 186390792900 + 14415364096 = 431730^2 + 120064^2 .
It is a super-2 number, since 2×2008061569962 (a number of 23 digits) contains 22 as substring.
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 2 ways as a sum of consecutive naturals, for example, 784200 + ... + 1008256.
Almost surely, 2200806156996 is an apocalyptic number.
200806156996 is the 448114-th square number.
It is an amenable number.
200806156996 is a deficient number, since it is larger than the sum of its proper divisors (150606186153).
200806156996 is an frugal number, since it uses more digits than its factorization.
200806156996 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448118 (or 224059 counting only the distinct ones).
The product of its (nonzero) digits is 1399680, while the sum is 52.
The spelling of 200806156996 in words is "two hundred billion, eight hundred six million, one hundred fifty-six thousand, nine hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •