Base | Representation |
---|---|
bin | 1100010011000010… |
… | …00100110010101010 |
3 | 122001010001020220200 |
4 | 12021201010302222 |
5 | 102010120210031 |
6 | 3011042133030 |
7 | 322415030244 |
oct | 61141046252 |
9 | 18033036820 |
10 | 6602116266 |
11 | 28887a4739 |
12 | 1343051176 |
13 | 812a55995 |
14 | 468b87094 |
15 | 2899228e6 |
hex | 189844caa |
6602116266 has 48 divisors (see below), whose sum is σ = 14788093320. Its totient is φ = 2127306240.
The previous prime is 6602116229. The next prime is 6602116267. The reversal of 6602116266 is 6626112066.
It is a happy number.
6602116266 is a `hidden beast` number, since 6 + 6 + 0 + 21 + 1 + 626 + 6 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 2302560225 + 4299556041 = 47985^2 + 65571^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 6602116266.
It is not an unprimeable number, because it can be changed into a prime (6602116267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 39406 + ... + 121478.
Almost surely, 26602116266 is an apocalyptic number.
6602116266 is an abundant number, since it is smaller than the sum of its proper divisors (8185977054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6602116266 is a wasteful number, since it uses less digits than its factorization.
6602116266 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82231 (or 82228 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 36.
The square root of 6602116266 is about 81253.4077193074. The cubic root of 6602116266 is about 1875.9779210156.
The spelling of 6602116266 in words is "six billion, six hundred two million, one hundred sixteen thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •