Base | Representation |
---|---|
bin | 1010000100101101… |
… | …0110001100011100 |
3 | 20222110020211110000 |
4 | 2201023112030130 |
5 | 21014222400033 |
6 | 1124154214300 |
7 | 124003344513 |
oct | 24113261434 |
9 | 6873224400 |
10 | 2704106268 |
11 | 1168441076 |
12 | 635724390 |
13 | 3412c37a6 |
14 | 1b91c167a |
15 | 10c5e6a13 |
hex | a12d631c |
2704106268 has 60 divisors (see below), whose sum is σ = 7082593672. Its totient is φ = 899644320.
The previous prime is 2704106263. The next prime is 2704106287. The reversal of 2704106268 is 8626014072.
2704106268 is a `hidden beast` number, since 27 + 0 + 4 + 1 + 0 + 626 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2704106263) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 167571 + ... + 182997.
Almost surely, 22704106268 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 2704106268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3541296836).
2704106268 is an abundant number, since it is smaller than the sum of its proper divisors (4378487404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2704106268 is a wasteful number, since it uses less digits than its factorization.
2704106268 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15984 (or 15973 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The square root of 2704106268 is about 52001.0217976532. The cubic root of 2704106268 is about 1393.1822039226.
The spelling of 2704106268 in words is "two billion, seven hundred four million, one hundred six thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •