Base | Representation |
---|---|
bin | 110001011011111101… |
… | …1111100111000111000 |
3 | 101011000211110222221120 |
4 | 1202313323330320320 |
5 | 3214411240132103 |
6 | 120434355505240 |
7 | 10445604661236 |
oct | 1426773747070 |
9 | 334024428846 |
10 | 106165161528 |
11 | 4102a514218 |
12 | 186aa5b8220 |
13 | a01bb8540a |
14 | 51d1b83956 |
15 | 2b655e9253 |
hex | 18b7efce38 |
106165161528 has 32 divisors (see below), whose sum is σ = 271059989760. Its totient is φ = 34635442400.
The previous prime is 106165161527. The next prime is 106165161541. The reversal of 106165161528 is 825161561601.
It is a happy number.
It is a super-2 number, since 2×1061651615282 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106165161528.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106165161527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47057898 + ... + 47060153.
It is an arithmetic number, because the mean of its divisors is an integer number (8470624680).
Almost surely, 2106165161528 is an apocalyptic number.
It is an amenable number.
106165161528 is an abundant number, since it is smaller than the sum of its proper divisors (164894828232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106165161528 is a wasteful number, since it uses less digits than its factorization.
106165161528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94118107 (or 94118103 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 42.
The spelling of 106165161528 in words is "one hundred six billion, one hundred sixty-five million, one hundred sixty-one thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •