Base | Representation |
---|---|
bin | 101000110100011110111… |
… | …1001000101110111101001 |
3 | 201212100002001121222220021 |
4 | 1101220331321011313221 |
5 | 1213404311002240001 |
6 | 15533153115400441 |
7 | 1116220420216504 |
oct | 121507571056751 |
9 | 21770061558807 |
10 | 5610265665001 |
11 | 1873333788118 |
12 | 767382753121 |
13 | 31907977785a |
14 | 15577718613b |
15 | 9ae08927ba1 |
hex | 51a3de45de9 |
5610265665001 has 4 divisors (see below), whose sum is σ = 5940281292372. Its totient is φ = 5280250037632.
The previous prime is 5610265664977. The next prime is 5610265665061. The reversal of 5610265665001 is 1005665620165.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4189697265625 + 1420568399376 = 2046875^2 + 1191876^2 .
It is a cyclic number.
It is not a de Polignac number, because 5610265665001 - 27 = 5610265664873 is a prime.
It is a super-2 number, since 2×56102656650012 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5610265665061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 165007813660 + ... + 165007813693.
It is an arithmetic number, because the mean of its divisors is an integer number (1485070323093).
Almost surely, 25610265665001 is an apocalyptic number.
It is an amenable number.
5610265665001 is a deficient number, since it is larger than the sum of its proper divisors (330015627371).
5610265665001 is a wasteful number, since it uses less digits than its factorization.
5610265665001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 330015627370.
The product of its (nonzero) digits is 324000, while the sum is 43.
The spelling of 5610265665001 in words is "five trillion, six hundred ten billion, two hundred sixty-five million, six hundred sixty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •