Base | Representation |
---|---|
bin | 10000000000101… |
… | …110100000000000 |
3 | 200201110121111011 |
4 | 100000232200000 |
5 | 1022232012140 |
6 | 42353330304 |
7 | 6441165643 |
oct | 2000564000 |
9 | 621417434 |
10 | 268625920 |
11 | 1286a56a2 |
12 | 75b66994 |
13 | 43864564 |
14 | 27967a5a |
15 | 188b2cea |
hex | 1002e800 |
268625920 has 96 divisors (see below), whose sum is σ = 662898600. Its totient is φ = 104398848.
The previous prime is 268625899. The next prime is 268626089. The reversal of 268625920 is 29526862.
It can be written as a sum of positive squares in 4 ways, for example, as 219513856 + 49112064 = 14816^2 + 7008^2 .
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 378526 + ... + 379234.
Almost surely, 2268625920 is an apocalyptic number.
268625920 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 268625920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (331449300).
268625920 is an abundant number, since it is smaller than the sum of its proper divisors (394272680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
268625920 is an equidigital number, since it uses as much as digits as its factorization.
268625920 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 773 (or 753 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 40.
The square root of 268625920 is about 16389.8114693245. The cubic root of 268625920 is about 645.2321100408.
The spelling of 268625920 in words is "two hundred sixty-eight million, six hundred twenty-five thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •