Base | Representation |
---|---|
bin | 111111101010101… |
… | …010000000000000 |
3 | 2202102220110210110 |
4 | 333222222000000 |
5 | 4141421143223 |
6 | 253554031320 |
7 | 35320045200 |
oct | 7752520000 |
9 | 2672813713 |
10 | 1068146688 |
11 | 4a8a39464 |
12 | 259878540 |
13 | 1403aa27b |
14 | a1c0a400 |
15 | 63b92d93 |
hex | 3faaa000 |
1068146688 has 168 divisors, whose sum is σ = 3316967712. Its totient is φ = 304840704.
The previous prime is 1068146641. The next prime is 1068146711. The reversal of 1068146688 is 8866418601.
It is a tau number, because it is divible by the number of its divisors (168).
It is a super-2 number, since 2×10681466882 = 2281874694170738688, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a nialpdrome in base 4.
It is a zygodrome in base 4.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1203781 + ... + 1204667.
Almost surely, 21068146688 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 1068146688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1658483856).
1068146688 is an abundant number, since it is smaller than the sum of its proper divisors (2248821024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1068146688 is an frugal number, since it uses more digits than its factorization.
1068146688 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 930 (or 899 counting only the distinct ones).
The product of its (nonzero) digits is 442368, while the sum is 48.
The square root of 1068146688 is about 32682.5134896323. The cubic root of 1068146688 is about 1022.2182557572.
The spelling of 1068146688 in words is "one billion, sixty-eight million, one hundred forty-six thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •