Base | Representation |
---|---|
bin | 1100101011101… |
… | …00011001100001 |
3 | 21102011210222002 |
4 | 12111310121201 |
5 | 204213223240 |
6 | 14320053345 |
7 | 2431145234 |
oct | 625643141 |
9 | 242153862 |
10 | 106382945 |
11 | 55061099 |
12 | 2b764255 |
13 | 19069bb6 |
14 | 101b341b |
15 | 9515d15 |
hex | 6574661 |
106382945 has 8 divisors (see below), whose sum is σ = 127974120. Its totient is φ = 84896640.
The previous prime is 106382929. The next prime is 106382953. The reversal of 106382945 is 549283601.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 29767936 + 76615009 = 5456^2 + 8753^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106382945 - 24 = 106382929 is a prime.
It is a super-2 number, since 2×1063829452 = 22634661973746050, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106382899 and 106382908.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 23966 + ... + 28055.
It is an arithmetic number, because the mean of its divisors is an integer number (15996765).
Almost surely, 2106382945 is an apocalyptic number.
It is an amenable number.
106382945 is a deficient number, since it is larger than the sum of its proper divisors (21591175).
106382945 is an equidigital number, since it uses as much as digits as its factorization.
106382945 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52435.
The product of its (nonzero) digits is 51840, while the sum is 38.
The square root of 106382945 is about 10314.2108277851. The cubic root of 106382945 is about 473.8315806905.
The spelling of 106382945 in words is "one hundred six million, three hundred eighty-two thousand, nine hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •