Base | Representation |
---|---|
bin | 110001100110000001… |
… | …1110011100000000000 |
3 | 101011220100202000012222 |
4 | 1203030003303200000 |
5 | 3221104201431134 |
6 | 120532055510212 |
7 | 10460144363501 |
oct | 1431403634000 |
9 | 334810660188 |
10 | 106502764544 |
11 | 41193041380 |
12 | 18783688368 |
13 | a073abaa07 |
14 | 5224944ba8 |
15 | 2b85084a2e |
hex | 18cc0f3800 |
106502764544 has 48 divisors (see below), whose sum is σ = 232312986360. Its totient is φ = 48410337280.
The previous prime is 106502764541. The next prime is 106502764561. The reversal of 106502764544 is 445467205601.
It is a super-2 number, since 2×1065027645442 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a zygodrome in base 2.
It is a junction number, because it is equal to n+sod(n) for n = 106502764495 and 106502764504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106502764541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2341259 + ... + 2386314.
Almost surely, 2106502764544 is an apocalyptic number.
It is an amenable number.
106502764544 is an abundant number, since it is smaller than the sum of its proper divisors (125810221816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106502764544 is an equidigital number, since it uses as much as digits as its factorization.
106502764544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4727606 (or 4727586 counting only the distinct ones).
The product of its (nonzero) digits is 806400, while the sum is 44.
The spelling of 106502764544 in words is "one hundred six billion, five hundred two million, seven hundred sixty-four thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •