Base | Representation |
---|---|
bin | 1011101111000001100… |
… | …0111010110111110011 |
3 | 201021100221220100212100 |
4 | 2323300120322313303 |
5 | 11300334444410201 |
6 | 232340421031443 |
7 | 20364605662203 |
oct | 2736030726763 |
9 | 637327810770 |
10 | 201601560051 |
11 | 78553908a51 |
12 | 330a3b55583 |
13 | 1601b080048 |
14 | 9a86aa0403 |
15 | 539dd80886 |
hex | 2ef063adf3 |
201601560051 has 12 divisors (see below), whose sum is σ = 292452051528. Its totient is φ = 133824210144.
The previous prime is 201601560029. The next prime is 201601560053. The reversal of 201601560051 is 150065106102.
It is a happy number.
201601560051 is a `hidden beast` number, since 2 + 0 + 1 + 6 + 0 + 1 + 5 + 600 + 51 = 666.
It is not a de Polignac number, because 201601560051 - 214 = 201601543667 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201601559997 and 201601560024.
It is not an unprimeable number, because it can be changed into a prime (201601560053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 48066945 + ... + 48071138.
It is an arithmetic number, because the mean of its divisors is an integer number (24371004294).
Almost surely, 2201601560051 is an apocalyptic number.
201601560051 is a deficient number, since it is larger than the sum of its proper divisors (90850491477).
201601560051 is a wasteful number, since it uses less digits than its factorization.
201601560051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96138322 (or 96138319 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
Adding to 201601560051 its reverse (150065106102), we get a palindrome (351666666153).
The spelling of 201601560051 in words is "two hundred one billion, six hundred one million, five hundred sixty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •