Base | Representation |
---|---|
bin | 1011101101010110010… |
… | …0011101100110101001 |
3 | 201020012121020002011201 |
4 | 2323111210131212221 |
5 | 11243424302213230 |
6 | 232224024524201 |
7 | 20350503253342 |
oct | 2732544354651 |
9 | 636177202151 |
10 | 201151601065 |
11 | 78342920118 |
12 | 32b99320661 |
13 | 15c78a98c1c |
14 | 9a430130c9 |
15 | 53745ee5ca |
hex | 2ed591d9a9 |
201151601065 has 8 divisors (see below), whose sum is σ = 241455064968. Its totient is φ = 160872518400.
The previous prime is 201151601047. The next prime is 201151601069. The reversal of 201151601065 is 560106151102.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 235192896 + 200916408169 = 15336^2 + 448237^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201151601065 - 215 = 201151568297 is a prime.
It is a super-2 number, since 2×2011516010652 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201151601069) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6077152 + ... + 6110161.
It is an arithmetic number, because the mean of its divisors is an integer number (30181883121).
Almost surely, 2201151601065 is an apocalyptic number.
It is an amenable number.
201151601065 is a deficient number, since it is larger than the sum of its proper divisors (40303463903).
201151601065 is a wasteful number, since it uses less digits than its factorization.
201151601065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12190619.
The product of its (nonzero) digits is 1800, while the sum is 28.
Adding to 201151601065 its reverse (560106151102), we get a palindrome (761257752167).
The spelling of 201151601065 in words is "two hundred one billion, one hundred fifty-one million, six hundred one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •