Base | Representation |
---|---|
bin | 1100101100001… |
… | …01010000110001 |
3 | 21102022022201022 |
4 | 12112011100301 |
5 | 204222431032 |
6 | 14321345225 |
7 | 2431553510 |
oct | 626052061 |
9 | 242268638 |
10 | 106452017 |
11 | 550a8a81 |
12 | 2b798215 |
13 | 19092479 |
14 | 101d0677 |
15 | 952b512 |
hex | 6585431 |
106452017 has 4 divisors (see below), whose sum is σ = 121659456. Its totient is φ = 91244580.
The previous prime is 106451999. The next prime is 106452043. The reversal of 106452017 is 710254601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 710254601 = 7 ⋅101464943.
It is not a de Polignac number, because 106452017 - 214 = 106435633 is a prime.
It is a super-2 number, since 2×1064520172 = 22664063846736578, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106452077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7603709 + ... + 7603722.
It is an arithmetic number, because the mean of its divisors is an integer number (30414864).
Almost surely, 2106452017 is an apocalyptic number.
It is an amenable number.
106452017 is a deficient number, since it is larger than the sum of its proper divisors (15207439).
106452017 is an equidigital number, since it uses as much as digits as its factorization.
106452017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15207438.
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 106452017 is about 10317.5586744152. The cubic root of 106452017 is about 473.9341078209.
The spelling of 106452017 in words is "one hundred six million, four hundred fifty-two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •