Base | Representation |
---|---|
bin | 1001111011110001… |
… | …1011101101011000 |
3 | 20212211202110111022 |
4 | 2132330123231120 |
5 | 20430130023024 |
6 | 1120335222012 |
7 | 123040041146 |
oct | 23674335530 |
9 | 6784673438 |
10 | 2666642264 |
11 | 1149282890 |
12 | 625077908 |
13 | 336607340 |
14 | 1b422c596 |
15 | 10919635e |
hex | 9ef1bb58 |
2666642264 has 64 divisors (see below), whose sum is σ = 6129527040. Its totient is φ = 1070213760.
The previous prime is 2666642239. The next prime is 2666642269. The reversal of 2666642264 is 4622466662.
It is a super-2 number, since 2×26666422642 = 14221961928302091392, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2666642269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24362 + ... + 76985.
It is an arithmetic number, because the mean of its divisors is an integer number (95773860).
Almost surely, 22666642264 is an apocalyptic number.
It is an amenable number.
2666642264 is an abundant number, since it is smaller than the sum of its proper divisors (3462884776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2666642264 is a wasteful number, since it uses less digits than its factorization.
2666642264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101400 (or 101396 counting only the distinct ones).
The product of its digits is 995328, while the sum is 44.
The square root of 2666642264 is about 51639.5416710877. The cubic root of 2666642264 is about 1386.7183187224.
The spelling of 2666642264 in words is "two billion, six hundred sixty-six million, six hundred forty-two thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.047 sec. • engine limits •