Base | Representation |
---|---|
bin | 110001011111100100… |
… | …1011001111010000000 |
3 | 101011100021002202210201 |
4 | 1202333021121322000 |
5 | 3220133222110033 |
6 | 120454400334544 |
7 | 10451604121351 |
oct | 1427711317200 |
9 | 334307082721 |
10 | 106286128768 |
11 | 41091826746 |
12 | 18723014454 |
13 | a03ac5a671 |
14 | 5203c71d28 |
15 | 2b7104147d |
hex | 18bf259e80 |
106286128768 has 64 divisors (see below), whose sum is σ = 215847779400. Its totient is φ = 52113604608.
The previous prime is 106286128703. The next prime is 106286128787. The reversal of 106286128768 is 867821682601.
It can be written as a sum of positive squares in 4 ways, for example, as 94082065984 + 12204062784 = 306728^2 + 110472^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×1062861287682 (a number of 23 digits) contains 22 as substring.
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, 22473028 + ... + 22477756.
Almost surely, 2106286128768 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 106286128768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107923889700).
106286128768 is an abundant number, since it is smaller than the sum of its proper divisors (109561650632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106286128768 is an equidigital number, since it uses as much as digits as its factorization.
106286128768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8109 (or 8097 counting only the distinct ones).
The product of its (nonzero) digits is 3096576, while the sum is 55.
The spelling of 106286128768 in words is "one hundred six billion, two hundred eighty-six million, one hundred twenty-eight thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •