Base | Representation |
---|---|
bin | 1111101001110000111… |
… | …0011000011110100000 |
3 | 221201002201200222201000 |
4 | 3322130032120132200 |
5 | 13401211200111240 |
6 | 323311324512000 |
7 | 25266546454410 |
oct | 3723416303640 |
9 | 851081628630 |
10 | 268908988320 |
11 | a4053128025 |
12 | 441490ab600 |
13 | 1c48671208b |
14 | d02dc58640 |
15 | 6edcdc7430 |
hex | 3e9c3987a0 |
268908988320 has 192 divisors, whose sum is σ = 1075636074240. Its totient is φ = 61464904704.
The previous prime is 268908988319. The next prime is 268908988349. The reversal of 268908988320 is 23889809862.
268908988320 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4416007 + ... + 4476486.
It is an arithmetic number, because the mean of its divisors is an integer number (5602271220).
Almost surely, 2268908988320 is an apocalyptic number.
268908988320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
268908988320 is an abundant number, since it is smaller than the sum of its proper divisors (806727085920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
268908988320 is a wasteful number, since it uses less digits than its factorization.
268908988320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8892524 (or 8892510 counting only the distinct ones).
The product of its (nonzero) digits is 23887872, while the sum is 63.
The spelling of 268908988320 in words is "two hundred sixty-eight billion, nine hundred eight million, nine hundred eighty-eight thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •