Base | Representation |
---|---|
bin | 11111111111001… |
… | …00000000110110 |
3 | 200200220002222020 |
4 | 33333210000312 |
5 | 1022142231242 |
6 | 42343014010 |
7 | 6435455310 |
oct | 1777440066 |
9 | 620802866 |
10 | 268320822 |
11 | 128507450 |
12 | 75a3a306 |
13 | 43788723 |
14 | 278c87b0 |
15 | 188526ec |
hex | ffe4036 |
268320822 has 64 divisors (see below), whose sum is σ = 680099328. Its totient is φ = 68544000.
The previous prime is 268320803. The next prime is 268320827. The reversal of 268320822 is 228023862.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (268320827) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23422 + ... + 32942.
It is an arithmetic number, because the mean of its divisors is an integer number (10626552).
Almost surely, 2268320822 is an apocalyptic number.
268320822 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 268320822, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (340049664).
268320822 is an abundant number, since it is smaller than the sum of its proper divisors (411778506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
268320822 is a wasteful number, since it uses less digits than its factorization.
268320822 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9605.
The product of its (nonzero) digits is 18432, while the sum is 33.
The square root of 268320822 is about 16380.5012743811. The cubic root of 268320822 is about 644.9877384845.
The spelling of 268320822 in words is "two hundred sixty-eight million, three hundred twenty thousand, eight hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •