Base | Representation |
---|---|
bin | 1100101110001… |
… | …01000010010001 |
3 | 21102210121000222 |
4 | 12113011002101 |
5 | 204304310413 |
6 | 14331122425 |
7 | 2434022204 |
oct | 627050221 |
9 | 242717028 |
10 | 106713233 |
11 | 55267260 |
12 | 2b8a3415 |
13 | 19154333 |
14 | 1025b93b |
15 | 957db08 |
hex | 65c5091 |
106713233 has 8 divisors (see below), whose sum is σ = 123262560. Its totient is φ = 91305280.
The previous prime is 106713227. The next prime is 106713239. The reversal of 106713233 is 332317601.
It is an interprime number because it is at equal distance from previous prime (106713227) and next prime (106713239).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106713233 - 218 = 106451089 is a prime.
It is a super-2 number, since 2×1067132332 = 22775428194624578, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106713239) 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 7 ways as a sum of consecutive naturals, for example, 285143 + ... + 285516.
It is an arithmetic number, because the mean of its divisors is an integer number (15407820).
Almost surely, 2106713233 is an apocalyptic number.
It is an amenable number.
106713233 is a deficient number, since it is larger than the sum of its proper divisors (16549327).
106713233 is a wasteful number, since it uses less digits than its factorization.
106713233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570687.
The product of its (nonzero) digits is 2268, while the sum is 26.
The square root of 106713233 is about 10330.2097268158. The cubic root of 106713233 is about 474.3214436747.
The spelling of 106713233 in words is "one hundred six million, seven hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •