Base | Representation |
---|---|
bin | 1100101011001… |
… | …10000101101011 |
3 | 21102001211120012 |
4 | 12111212011223 |
5 | 204204334311 |
6 | 14314522135 |
7 | 2430512321 |
oct | 625460553 |
9 | 242054505 |
10 | 106324331 |
11 | 55021053 |
12 | 2b73634b |
13 | 19049309 |
14 | 10199d11 |
15 | 950378b |
hex | 656616b |
106324331 has 8 divisors (see below), whose sum is σ = 111171840. Its totient is φ = 101495592.
The previous prime is 106324321. The next prime is 106324333. The reversal of 106324331 is 133423601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106324331 - 210 = 106323307 is a prime.
It is a super-2 number, since 2×1063243312 = 22609726725195122, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106324297 and 106324306.
It is not an unprimeable number, because it can be changed into a prime (106324333) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7610 + ... + 16448.
It is an arithmetic number, because the mean of its divisors is an integer number (13896480).
Almost surely, 2106324331 is an apocalyptic number.
106324331 is a deficient number, since it is larger than the sum of its proper divisors (4847509).
106324331 is an equidigital number, since it uses as much as digits as its factorization.
106324331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9385.
The product of its (nonzero) digits is 1296, while the sum is 23.
The square root of 106324331 is about 10311.3690167698. The cubic root of 106324331 is about 473.7445420943.
Adding to 106324331 its reverse (133423601), we get a palindrome (239747932).
The spelling of 106324331 in words is "one hundred six million, three hundred twenty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •