Base | Representation |
---|---|
bin | 1011110100011110110… |
… | …1001101001010011001 |
3 | 201102011001102210201001 |
4 | 2331013231031022121 |
5 | 11311340010330031 |
6 | 233142031425001 |
7 | 20446114506352 |
oct | 2750755151231 |
9 | 642131383631 |
10 | 203066495641 |
11 | 79135819819 |
12 | 33432685161 |
13 | 161c2716139 |
14 | 9b85476d29 |
15 | 54377a0861 |
hex | 2f47b4d299 |
203066495641 has 9 divisors (see below), whose sum is σ = 205919692509. Its totient is φ = 200252317536.
The previous prime is 203066495629. The next prime is 203066495659. The reversal of 203066495641 is 146594660302.
The square root of 203066495641 is 450629.
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 70002047241 + 133064448400 = 264579^2 + 364780^2 .
It is not a de Polignac number, because 203066495641 - 227 = 202932277913 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 203066495591 and 203066495600.
It is not an unprimeable number, because it can be changed into a prime (203066495341) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 32892831 + ... + 32899003.
Almost surely, 2203066495641 is an apocalyptic number.
203066495641 is the 450629-th square number.
203066495641 is the 225315-th centered octagonal number.
It is an amenable number.
203066495641 is a deficient number, since it is larger than the sum of its proper divisors (2853196868).
203066495641 is an frugal number, since it uses more digits than its factorization.
203066495641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12492 (or 6246 counting only the distinct ones).
The product of its (nonzero) digits is 933120, while the sum is 46.
The spelling of 203066495641 in words is "two hundred three billion, sixty-six million, four hundred ninety-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •