Base | Representation |
---|---|
bin | 10011101011100100… |
… | …11111101111010001 |
3 | 1000021100222210122200 |
4 | 21311302133233101 |
5 | 133114410343230 |
6 | 4504244153413 |
7 | 522560263644 |
oct | 116562375721 |
9 | 30240883580 |
10 | 10566106065 |
11 | 4532322969 |
12 | 206a698869 |
13 | cc5079888 |
14 | 723405a5b |
15 | 41c933160 |
hex | 275c9fbd1 |
10566106065 has 24 divisors (see below), whose sum is σ = 18946123560. Its totient is φ = 5440936704.
The previous prime is 10566106063. The next prime is 10566106073. The reversal of 10566106065 is 56060166501.
It can be written as a sum of positive squares in 4 ways, for example, as 295702416 + 10270403649 = 17196^2 + 101343^2 .
It is not a de Polignac number, because 10566106065 - 21 = 10566106063 is a prime.
It is a super-2 number, since 2×105661060652 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10566106063) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4047012 + ... + 4049621.
It is an arithmetic number, because the mean of its divisors is an integer number (789421815).
Almost surely, 210566106065 is an apocalyptic number.
10566106065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10566106065 is a deficient number, since it is larger than the sum of its proper divisors (8380017495).
10566106065 is a wasteful number, since it uses less digits than its factorization.
10566106065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8096673 (or 8096670 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
The spelling of 10566106065 in words is "ten billion, five hundred sixty-six million, one hundred six thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •