Base | Representation |
---|---|
bin | 1011101101010010101… |
… | …1000111000100010001 |
3 | 201020011112221020200122 |
4 | 2323110223013010101 |
5 | 11243411430112140 |
6 | 232222330400025 |
7 | 20350231415045 |
oct | 2732453070421 |
9 | 636145836618 |
10 | 201136566545 |
11 | 783353914a2 |
12 | 32b94290015 |
13 | 15c75933965 |
14 | 9a4101c025 |
15 | 537312eab5 |
hex | 2ed4ac7111 |
201136566545 has 8 divisors (see below), whose sum is σ = 241395042024. Its totient is φ = 160888478464.
The previous prime is 201136566487. The next prime is 201136566557. The reversal of 201136566545 is 545665631102.
It can be written as a sum of positive squares in 4 ways, for example, as 7631594881 + 193504971664 = 87359^2 + 439892^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201136566545 - 216 = 201136501009 is a prime.
It is a super-2 number, since 2×2011365665452 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 201136566496 and 201136566505.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2554184 + ... + 2631753.
It is an arithmetic number, because the mean of its divisors is an integer number (30174380253).
Almost surely, 2201136566545 is an apocalyptic number.
It is an amenable number.
201136566545 is a deficient number, since it is larger than the sum of its proper divisors (40258475479).
201136566545 is an equidigital number, since it uses as much as digits as its factorization.
201136566545 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5193699.
The product of its (nonzero) digits is 648000, while the sum is 44.
The spelling of 201136566545 in words is "two hundred one billion, one hundred thirty-six million, five hundred sixty-six thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •