Base | Representation |
---|---|
bin | 1100101111111… |
… | …01100111110101 |
3 | 21110020100222102 |
4 | 12113331213311 |
5 | 204334220023 |
6 | 14340111445 |
7 | 2436006020 |
oct | 627754765 |
9 | 243210872 |
10 | 106945013 |
11 | 5540540a |
12 | 2b995585 |
13 | 19205996 |
14 | 102bc1b7 |
15 | 95c7628 |
hex | 65fd9f5 |
106945013 has 8 divisors (see below), whose sum is σ = 122408832. Its totient is φ = 91527696.
The previous prime is 106944997. The next prime is 106945031. The reversal of 106945013 is 310549601.
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 106945013 - 24 = 106944997 is a prime.
It is a super-2 number, since 2×1069450132 = 22874471611140338, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106945063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6545 + ... + 16022.
It is an arithmetic number, because the mean of its divisors is an integer number (15301104).
Almost surely, 2106945013 is an apocalyptic number.
It is an amenable number.
106945013 is a deficient number, since it is larger than the sum of its proper divisors (15463819).
106945013 is an equidigital number, since it uses as much as digits as its factorization.
106945013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23251.
The product of its (nonzero) digits is 3240, while the sum is 29.
The square root of 106945013 is about 10341.4221942632. The cubic root of 106945013 is about 474.6646023819.
The spelling of 106945013 in words is "one hundred six million, nine hundred forty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •