Base | Representation |
---|---|
bin | 1100101100101… |
… | …01010100001100 |
3 | 21102102122220200 |
4 | 12112111110030 |
5 | 204232032042 |
6 | 14323013500 |
7 | 2432246304 |
oct | 626252414 |
9 | 242378820 |
10 | 106517772 |
11 | 55143419 |
12 | 2b80a290 |
13 | 190b638a |
14 | 1020a604 |
15 | 9540c4c |
hex | 659550c |
106517772 has 18 divisors (see below), whose sum is σ = 269253348. Its totient is φ = 35505912.
The previous prime is 106517711. The next prime is 106517779. The reversal of 106517772 is 277715601.
It is a tau number, because it is divible by the number of its divisors (18).
It is a super-2 number, since 2×1065177722 = 22692071503687968, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 2958827 = 106517772 / (1 + 0 + 6 + 5 + 1 + 7 + 7 + 7 + 2).
It is not an unprimeable number, because it can be changed into a prime (106517779) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1479378 + ... + 1479449.
Almost surely, 2106517772 is an apocalyptic number.
106517772 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106517772 is an abundant number, since it is smaller than the sum of its proper divisors (162735576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106517772 is a wasteful number, since it uses less digits than its factorization.
106517772 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2958837 (or 2958832 counting only the distinct ones).
The product of its (nonzero) digits is 20580, while the sum is 36.
The square root of 106517772 is about 10320.7447405698. The cubic root of 106517772 is about 474.0316701587.
The spelling of 106517772 in words is "one hundred six million, five hundred seventeen thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •