Base | Representation |
---|---|
bin | 1111100111111100011… |
… | …1010000110001100100 |
3 | 221122211200200101212120 |
4 | 3321333013100301210 |
5 | 13344211132120000 |
6 | 323151040345540 |
7 | 25251466206630 |
oct | 3717707206144 |
9 | 848750611776 |
10 | 268420582500 |
11 | a392246a554 |
12 | 440316152b0 |
13 | 1c409489355 |
14 | cdc503ddc0 |
15 | 6eb009e6a0 |
hex | 3e7f1d0c64 |
268420582500 has 240 divisors, whose sum is σ = 903687227520. Its totient is φ = 60719616000.
The previous prime is 268420582499. The next prime is 268420582537. The reversal of 268420582500 is 5285024862.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 5066146 + ... + 5118854.
It is an arithmetic number, because the mean of its divisors is an integer number (3765363448).
Almost surely, 2268420582500 is an apocalyptic number.
268420582500 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 268420582500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (451843613760).
268420582500 is an abundant number, since it is smaller than the sum of its proper divisors (635266645020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
268420582500 is a wasteful number, since it uses less digits than its factorization.
268420582500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52840 (or 52823 counting only the distinct ones).
The product of its (nonzero) digits is 307200, while the sum is 42.
The spelling of 268420582500 in words is "two hundred sixty-eight billion, four hundred twenty million, five hundred eighty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •