Base | Representation |
---|---|
bin | 1100101001000… |
… | …11110010101010 |
3 | 21101120001001200 |
4 | 12110203302222 |
5 | 204122142103 |
6 | 14305025030 |
7 | 2425301526 |
oct | 624436252 |
9 | 241501050 |
10 | 106052778 |
11 | 54956027 |
12 | 2b625176 |
13 | 18c82830 |
14 | 10128d86 |
15 | 949d0a3 |
hex | 6523caa |
106052778 has 24 divisors (see below), whose sum is σ = 247457028. Its totient is φ = 32631552.
The previous prime is 106052777. The next prime is 106052819. The reversal of 106052778 is 877250601.
106052778 is a `hidden beast` number, since 1 + 0 + 60 + 527 + 78 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 105945849 + 106929 = 10293^2 + 327^2 .
It is a super-2 number, since 2×1060527782 = 22494383443034568, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (106052777) 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 11 ways as a sum of consecutive naturals, for example, 226375 + ... + 226842.
Almost surely, 2106052778 is an apocalyptic number.
106052778 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
106052778 is an abundant number, since it is smaller than the sum of its proper divisors (141404250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106052778 is a wasteful number, since it uses less digits than its factorization.
106052778 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 453238 (or 453235 counting only the distinct ones).
The product of its (nonzero) digits is 23520, while the sum is 36.
The square root of 106052778 is about 10298.1929482798. The cubic root of 106052778 is about 473.3408827512.
The spelling of 106052778 in words is "one hundred six million, fifty-two thousand, seven hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •