Base | Representation |
---|---|
bin | 1111101001001111011… |
… | …1000011000100000000 |
3 | 221200201221122020121121 |
4 | 3322103313003010000 |
5 | 13400414233403233 |
6 | 323245353002024 |
7 | 25263223601242 |
oct | 3722367030400 |
9 | 850657566547 |
10 | 268768653568 |
11 | a3a90997498 |
12 | 4410a0b3314 |
13 | 1c46361856c |
14 | d019368092 |
15 | 6ed090692d |
hex | 3e93dc3100 |
268768653568 has 144 divisors (see below), whose sum is σ = 560189105280. Its totient is φ = 128585318400.
The previous prime is 268768653553. The next prime is 268768653599. The reversal of 268768653568 is 865356867862.
It is a junction number, because it is equal to n+sod(n) for n = 268768653497 and 268768653506.
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 15 ways as a sum of consecutive naturals, for example, 177873933 + ... + 177875443.
It is an arithmetic number, because the mean of its divisors is an integer number (3890202120).
Almost surely, 2268768653568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 268768653568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (280094552640).
268768653568 is an abundant number, since it is smaller than the sum of its proper divisors (291420451712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
268768653568 is a wasteful number, since it uses less digits than its factorization.
268768653568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1864 (or 1850 counting only the distinct ones).
The product of its digits is 696729600, while the sum is 70.
The spelling of 268768653568 in words is "two hundred sixty-eight billion, seven hundred sixty-eight million, six hundred fifty-three thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •