Base | Representation |
---|---|
bin | 1010000011110001… |
… | …1010110000000000 |
3 | 20222011220000010120 |
4 | 2200330122300000 |
5 | 21012222132033 |
6 | 1123534300240 |
7 | 123625155060 |
oct | 24074326000 |
9 | 6864800116 |
10 | 2700192768 |
11 | 1166208879 |
12 | 634357680 |
13 | 340553400 |
14 | 1b88833a0 |
15 | 10c0c21b3 |
hex | a0f1ac00 |
2700192768 has 264 divisors, whose sum is σ = 8918500608. Its totient is φ = 711180288.
The previous prime is 2700192757. The next prime is 2700192791. The reversal of 2700192768 is 8672910072.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3633805 + ... + 3634547.
Almost surely, 22700192768 is an apocalyptic number.
2700192768 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2700192768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4459250304).
2700192768 is an abundant number, since it is smaller than the sum of its proper divisors (6218307840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2700192768 is a wasteful number, since it uses less digits than its factorization.
2700192768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 799 (or 768 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 42.
The square root of 2700192768 is about 51963.3791049043. The cubic root of 2700192768 is about 1392.5097881766.
The spelling of 2700192768 in words is "two billion, seven hundred million, one hundred ninety-two thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •