Base | Representation |
---|---|
bin | 1001111011011110… |
… | …1110101010000000 |
3 | 20212202102210222111 |
4 | 2132313232222000 |
5 | 20424321043102 |
6 | 1120252545104 |
7 | 123023414110 |
oct | 23667565200 |
9 | 6782383874 |
10 | 2665409152 |
11 | 114861038a |
12 | 624782194 |
13 | 336294ca3 |
14 | 1b3dcb040 |
15 | 109000cd7 |
hex | 9edeea80 |
2665409152 has 64 divisors (see below), whose sum is σ = 6168176640. Its totient is φ = 1123568640.
The previous prime is 2665409147. The next prime is 2665409179. The reversal of 2665409152 is 2519045662.
It is a tau number, because it is divible by the number of its divisors (64).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30273 + ... + 79039.
It is an arithmetic number, because the mean of its divisors is an integer number (96377760).
Almost surely, 22665409152 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 2665409152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3084088320).
2665409152 is an abundant number, since it is smaller than the sum of its proper divisors (3502767488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2665409152 is an equidigital number, since it uses as much as digits as its factorization.
2665409152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48849 (or 48837 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 40.
The square root of 2665409152 is about 51627.6006802563. The cubic root of 2665409152 is about 1386.5045364355.
The spelling of 2665409152 in words is "two billion, six hundred sixty-five million, four hundred nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •