Base | Representation |
---|---|
bin | 111111101101000… |
… | …100000001001110 |
3 | 2202111002112011201 |
4 | 333231010001032 |
5 | 4142101340200 |
6 | 254015340114 |
7 | 35325313351 |
oct | 7755040116 |
9 | 2674075151 |
10 | 1068777550 |
11 | 4a932a435 |
12 | 259b2163a |
13 | 14056b469 |
14 | a1d32298 |
15 | 63c69c6a |
hex | 3fb4404e |
1068777550 has 24 divisors (see below), whose sum is σ = 2092555800. Its totient is φ = 405010080.
The previous prime is 1068777527. The next prime is 1068777553. The reversal of 1068777550 is 557778601.
1068777550 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10687775502 = 2284570902768005000, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1068777550.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1068777553) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 561565 + ... + 563464.
It is an arithmetic number, because the mean of its divisors is an integer number (87189825).
Almost surely, 21068777550 is an apocalyptic number.
1068777550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1068777550 is a deficient number, since it is larger than the sum of its proper divisors (1023778250).
1068777550 is a wasteful number, since it uses less digits than its factorization.
1068777550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125060 (or 1125055 counting only the distinct ones).
The product of its (nonzero) digits is 411600, while the sum is 46.
The square root of 1068777550 is about 32692.1634340709. The cubic root of 1068777550 is about 1022.4194614980.
The spelling of 1068777550 in words is "one billion, sixty-eight million, seven hundred seventy-seven thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •