Base | Representation |
---|---|
bin | 110001010111101110… |
… | …0101110001100001000 |
3 | 101010122220112002211112 |
4 | 1202233130232030020 |
5 | 3214113311212003 |
6 | 120412311345452 |
7 | 10442225365121 |
oct | 1425734561410 |
9 | 333586462745 |
10 | 106022757128 |
11 | 40a6709a732 |
12 | 1866a982288 |
13 | 9cc8515862 |
14 | 51bacb5048 |
15 | 2b57d6a3d8 |
hex | 18af72e308 |
106022757128 has 108 divisors (see below), whose sum is σ = 215313305085. Its totient is φ = 48936555648.
The previous prime is 106022757101. The next prime is 106022757131. The reversal of 106022757128 is 821757220601.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 105535319044 + 487438084 = 324862^2 + 22078^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=230242.
It is a super-2 number, since 2×1060227571282 (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 26 ways as a sum of consecutive naturals, for example, 1277382575 + ... + 1277382657.
Almost surely, 2106022757128 is an apocalyptic number.
It is an amenable number.
106022757128 is an abundant number, since it is smaller than the sum of its proper divisors (109290547957).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106022757128 is an frugal number, since it uses more digits than its factorization.
106022757128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 356 (or 177 counting only the distinct ones).
The product of its (nonzero) digits is 94080, while the sum is 41.
Adding to 106022757128 its reverse (821757220601), we get a palindrome (927779977729).
The spelling of 106022757128 in words is "one hundred six billion, twenty-two million, seven hundred fifty-seven thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •