Base | Representation |
---|---|
bin | 110000000001000010110111… |
… | …110011110100101000000100 |
3 | 1000200201102102102002201210001 |
4 | 300001002313303310220010 |
5 | 210134420104132401111 |
6 | 2025045503402411044 |
7 | 62324052410166031 |
oct | 6001026763645004 |
9 | 1020642372081701 |
10 | 211178035825156 |
11 | 61319113906844 |
12 | 1b827874b00a84 |
13 | 90ab00741462a |
14 | 3a21100184388 |
15 | 196335a7b91c1 |
hex | c010b7cf4a04 |
211178035825156 has 9 divisors (see below), whose sum is σ = 369561613555911. Its totient is φ = 105589003380612.
The previous prime is 211178035825153. The next prime is 211178035825171. The reversal of 211178035825156 is 651528530871112.
The square root of 211178035825156 is 14531966.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211178035825097 and 211178035825106.
It is not an unprimeable number, because it can be changed into a prime (211178035825153) by changing a digit.
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, 25430941 + ... + 32696923.
Almost surely, 2211178035825156 is an apocalyptic number.
211178035825156 is the 14531966-th square number.
It is an amenable number.
211178035825156 is a deficient number, since it is larger than the sum of its proper divisors (158383577730755).
211178035825156 is an frugal number, since it uses more digits than its factorization.
211178035825156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14531970 (or 7265985 counting only the distinct ones).
The product of its (nonzero) digits is 4032000, while the sum is 55.
The spelling of 211178035825156 in words is "two hundred eleven trillion, one hundred seventy-eight billion, thirty-five million, eight hundred twenty-five thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •