Base | Representation |
---|---|
bin | 1001111011111011… |
… | …1010000010000000 |
3 | 20212212222102001101 |
4 | 2132332322002000 |
5 | 20430311301002 |
6 | 1120401144144 |
7 | 123045411610 |
oct | 23676720200 |
9 | 6785872041 |
10 | 2667290752 |
11 | 1149686025 |
12 | 62532b054 |
13 | 3367a3569 |
14 | 1b435aa40 |
15 | 109273587 |
hex | 9efba080 |
2667290752 has 128 divisors (see below), whose sum is σ = 6588449280. Its totient is φ = 1049395200.
The previous prime is 2667290723. The next prime is 2667290779. The reversal of 2667290752 is 2570927662.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-2 number, since 2×26672907522 = 14228879911409451008, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 622377 + ... + 626647.
It is an arithmetic number, because the mean of its divisors is an integer number (51472260).
Almost surely, 22667290752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2667290752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3294224640).
2667290752 is an abundant number, since it is smaller than the sum of its proper divisors (3921158528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2667290752 is a wasteful number, since it uses less digits than its factorization.
2667290752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4350 (or 4338 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 46.
The square root of 2667290752 is about 51645.8202761850. The cubic root of 2667290752 is about 1386.8307194137.
The spelling of 2667290752 in words is "two billion, six hundred sixty-seven million, two hundred ninety thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •