Base | Representation |
---|---|
bin | 1000001011011110… |
… | …0110001110011000 |
3 | 12200000102200020000 |
4 | 2002313212032120 |
5 | 13444034100233 |
6 | 1001511333000 |
7 | 105260253552 |
oct | 20267461630 |
9 | 5600380200 |
10 | 2195612568 |
11 | a27403246 |
12 | 513381160 |
13 | 28cb56646 |
14 | 16b8584d2 |
15 | ccb51d13 |
hex | 82de6398 |
2195612568 has 160 divisors (see below), whose sum is σ = 6460819200. Its totient is φ = 695293632.
The previous prime is 2195612561. The next prime is 2195612569. The reversal of 2195612568 is 8652165912.
2195612568 is a `hidden beast` number, since 2 + 1 + 9 + 561 + 25 + 68 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2195612561) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2667405 + ... + 2668227.
It is an arithmetic number, because the mean of its divisors is an integer number (40380120).
Almost surely, 22195612568 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 2195612568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3230409600).
2195612568 is an abundant number, since it is smaller than the sum of its proper divisors (4265206632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2195612568 is a wasteful number, since it uses less digits than its factorization.
2195612568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1043 (or 1030 counting only the distinct ones).
The product of its digits is 259200, while the sum is 45.
The square root of 2195612568 is about 46857.3640743907. The cubic root of 2195612568 is about 1299.7262871474.
The spelling of 2195612568 in words is "two billion, one hundred ninety-five million, six hundred twelve thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •