Base | Representation |
---|---|
bin | 1001101100111000… |
… | …1110100001000000 |
3 | 20201111020222000000 |
4 | 2123032032201000 |
5 | 20313133313302 |
6 | 1110225000000 |
7 | 121351213566 |
oct | 23316164100 |
9 | 6644228000 |
10 | 2604197952 |
11 | 1117002514 |
12 | 608183000 |
13 | 3266b2945 |
14 | 1a9c15a36 |
15 | 10395e31c |
hex | 9b38e840 |
2604197952 has 98 divisors (see below), whose sum is σ = 7748152398. Its totient is φ = 868050432.
The previous prime is 2604197927. The next prime is 2604197971. The reversal of 2604197952 is 2597914062.
It can be written as a sum of positive squares in only one way, i.e., 2598552576 + 5645376 = 50976^2 + 2376^2 .
It is a junction number, because it is equal to n+sod(n) for n = 2604197898 and 2604197907.
It is an unprimeable number.
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 13 ways as a sum of consecutive naturals, for example, 18748 + ... + 74564.
Almost surely, 22604197952 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 2604197952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3874076199).
2604197952 is an abundant number, since it is smaller than the sum of its proper divisors (5143954446).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2604197952 is an frugal number, since it uses more digits than its factorization.
2604197952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55847 (or 55822 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 45.
The square root of 2604197952 is about 51031.3428394746. The cubic root of 2604197952 is about 1375.8085297851.
The spelling of 2604197952 in words is "two billion, six hundred four million, one hundred ninety-seven thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •