Base | Representation |
---|---|
bin | 110001101011100001… |
… | …1101001010110001000 |
3 | 101012101012220222022121 |
4 | 1203113003221112020 |
5 | 3221443420203303 |
6 | 121002250301024 |
7 | 10464544565200 |
oct | 1432703512610 |
9 | 335335828277 |
10 | 106687272328 |
11 | 4127820284a |
12 | 18815427774 |
13 | a0a30ac610 |
14 | 5241253400 |
15 | 2b9637d9bd |
hex | 18d70e9588 |
106687272328 has 48 divisors (see below), whose sum is σ = 250597863180. Its totient is φ = 42205951872.
The previous prime is 106687272323. The next prime is 106687272331. The reversal of 106687272328 is 823272786601.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 106653190084 + 34082244 = 326578^2 + 5838^2 .
It is a super-2 number, since 2×1066872723282 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is not an unprimeable number, because it can be changed into a prime (106687272323) 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 11 ways as a sum of consecutive naturals, for example, 10462651 + ... + 10472842.
Almost surely, 2106687272328 is an apocalyptic number.
It is an amenable number.
106687272328 is an abundant number, since it is smaller than the sum of its proper divisors (143910590852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106687272328 is a wasteful number, since it uses less digits than its factorization.
106687272328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20935526 (or 20935515 counting only the distinct ones).
The product of its (nonzero) digits is 2709504, while the sum is 52.
The spelling of 106687272328 in words is "one hundred six billion, six hundred eighty-seven million, two hundred seventy-two thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •