Base | Representation |
---|---|
bin | 1111100111000011101… |
… | …0000011101100000000 |
3 | 221122020002012100102120 |
4 | 3321300322003230000 |
5 | 13343214123140000 |
6 | 323111244044240 |
7 | 25242543266553 |
oct | 3716072035400 |
9 | 848202170376 |
10 | 268182240000 |
11 | a380a979284 |
12 | 43b85833680 |
13 | 1c39bc98a9c |
14 | cda151a69a |
15 | 6e991be6a0 |
hex | 3e70e83b00 |
268182240000 has 720 divisors, whose sum is σ = 937895777280. Its totient is φ = 67921920000.
The previous prime is 268182239999. The next prime is 268182240023. The reversal of 268182240000 is 42281862.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 996959866 + ... + 996960134.
It is an arithmetic number, because the mean of its divisors is an integer number (1302633024).
Almost surely, 2268182240000 is an apocalyptic number.
268182240000 is a gapful number since it is divisible by the number (20) 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 268182240000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (468947888640).
268182240000 is an abundant number, since it is smaller than the sum of its proper divisors (669713537280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
268182240000 is an equidigital number, since it uses as much as digits as its factorization.
268182240000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406 (or 377 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 33.
The spelling of 268182240000 in words is "two hundred sixty-eight billion, one hundred eighty-two million, two hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •