Base | Representation |
---|---|
bin | 1000000100100001… |
… | …1010011011100000 |
3 | 12120222120220000120 |
4 | 2001020122123200 |
5 | 13414103410042 |
6 | 554550520240 |
7 | 104454442125 |
oct | 20110323340 |
9 | 5528526016 |
10 | 2166466272 |
11 | a11a061a3 |
12 | 505666080 |
13 | 286ac0109 |
14 | 167a2c74c |
15 | ca2e5dec |
hex | 8121a6e0 |
2166466272 has 48 divisors (see below), whose sum is σ = 5691329280. Its totient is φ = 721602432.
The previous prime is 2166466271. The next prime is 2166466283. The reversal of 2166466272 is 2726646612.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-3 number, since 3×21664662723 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2166466271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 128679 + ... + 144537.
It is an arithmetic number, because the mean of its divisors is an integer number (118569360).
Almost surely, 22166466272 is an apocalyptic number.
It is an amenable number.
2166466272 is an abundant number, since it is smaller than the sum of its proper divisors (3524863008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2166466272 is a wasteful number, since it uses less digits than its factorization.
2166466272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17295 (or 17287 counting only the distinct ones).
The product of its digits is 290304, while the sum is 42.
The square root of 2166466272 is about 46545.3141787656. The cubic root of 2166466272 is about 1293.9494512542.
The spelling of 2166466272 in words is "two billion, one hundred sixty-six million, four hundred sixty-six thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •