Base | Representation |
---|---|
bin | 1000000100111010… |
… | …1010011100001100 |
3 | 12121002200010112200 |
4 | 2001032222130030 |
5 | 13420013322331 |
6 | 555050001500 |
7 | 104504405001 |
oct | 20116523414 |
9 | 5532603480 |
10 | 2168104716 |
11 | a12925188 |
12 | 506116290 |
13 | 287244acb |
14 | 167d378a8 |
15 | ca51b5e6 |
hex | 813aa70c |
2168104716 has 18 divisors (see below), whose sum is σ = 5480487012. Its totient is φ = 722701560.
The previous prime is 2168104693. The next prime is 2168104717. The reversal of 2168104716 is 6174018612.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 60225131 = 2168104716 / (2 + 1 + 6 + 8 + 1 + 0 + 4 + 7 + 1 + 6).
It is not an unprimeable number, because it can be changed into a prime (2168104717) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 30112530 + ... + 30112601.
Almost surely, 22168104716 is an apocalyptic number.
It is an amenable number.
2168104716 is an abundant number, since it is smaller than the sum of its proper divisors (3312382296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2168104716 is a wasteful number, since it uses less digits than its factorization.
2168104716 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60225141 (or 60225136 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 36.
The square root of 2168104716 is about 46562.9113780485. The cubic root of 2168104716 is about 1294.2755628761.
The spelling of 2168104716 in words is "two billion, one hundred sixty-eight million, one hundred four thousand, seven hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •