Base | Representation |
---|---|
bin | 110001110011101110… |
… | …0001101110100000000 |
3 | 101020002101011010200120 |
4 | 1203213130031310000 |
5 | 3223024302223413 |
6 | 121045430020240 |
7 | 10504423155600 |
oct | 1434734156400 |
9 | 336071133616 |
10 | 106962148608 |
11 | 413a9387427 |
12 | 188914a7680 |
13 | a118021ac3 |
14 | 5269966c00 |
15 | 2bb0578723 |
hex | 18e770dd00 |
106962148608 has 216 divisors, whose sum is σ = 342575462880. Its totient is φ = 29506498560.
The previous prime is 106962148603. The next prime is 106962148651. The reversal of 106962148608 is 806841269601.
It is a super-2 number, since 2×1069621486082 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106962148603) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 1042323 + ... + 1140333.
Almost surely, 2106962148608 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 106962148608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171287731440).
106962148608 is an abundant number, since it is smaller than the sum of its proper divisors (235613314272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106962148608 is an equidigital number, since it uses as much as digits as its factorization.
106962148608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98073 (or 98052 counting only the distinct ones).
The product of its (nonzero) digits is 995328, while the sum is 51.
The spelling of 106962148608 in words is "one hundred six billion, nine hundred sixty-two million, one hundred forty-eight thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •