Base | Representation |
---|---|
bin | 1100101011011… |
… | …00011010000101 |
3 | 21102010011001210 |
4 | 12111230122011 |
5 | 204211201323 |
6 | 14315242033 |
7 | 2430650634 |
oct | 625543205 |
9 | 242104053 |
10 | 106350213 |
11 | 55039542 |
12 | 2b749319 |
13 | 19058028 |
14 | 101a551b |
15 | 950b293 |
hex | 656c685 |
106350213 has 8 divisors (see below), whose sum is σ = 141968800. Its totient is φ = 70815888.
The previous prime is 106350203. The next prime is 106350217. The reversal of 106350213 is 312053601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106350213 - 26 = 106350149 is a prime.
It is a super-2 number, since 2×1063502132 = 22620735610290738, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106350213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106350217) by changing a digit.
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, 18058 + ... + 23211.
It is an arithmetic number, because the mean of its divisors is an integer number (17746100).
Almost surely, 2106350213 is an apocalyptic number.
It is an amenable number.
106350213 is a deficient number, since it is larger than the sum of its proper divisors (35618587).
106350213 is an equidigital number, since it uses as much as digits as its factorization.
106350213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42131.
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 106350213 is about 10312.6239628913. The cubic root of 106350213 is about 473.7829793969.
The spelling of 106350213 in words is "one hundred six million, three hundred fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •