Base | Representation |
---|---|
bin | 110001101001001110… |
… | …1011101001100010101 |
3 | 101012011211210212102001 |
4 | 1203102131131030111 |
5 | 3221314144332323 |
6 | 120550453315301 |
7 | 10462620225205 |
oct | 1432235351425 |
9 | 335154725361 |
10 | 106610152213 |
11 | 41238719314 |
12 | 187b3635b31 |
13 | a09011a006 |
14 | 5234cda405 |
15 | 2b8e6e83ad |
hex | 18d275d315 |
106610152213 has 8 divisors (see below), whose sum is σ = 106678025856. Its totient is φ = 106542307200.
The previous prime is 106610152211. The next prime is 106610152223. The reversal of 106610152213 is 312251016601.
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 106610152213 - 21 = 106610152211 is a prime.
It is a super-2 number, since 2×1066101522132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106610152211) 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, 19272258 + ... + 19277788.
It is an arithmetic number, because the mean of its divisors is an integer number (13334753232).
Almost surely, 2106610152213 is an apocalyptic number.
It is an amenable number.
106610152213 is a deficient number, since it is larger than the sum of its proper divisors (67873643).
106610152213 is an equidigital number, since it uses as much as digits as its factorization.
106610152213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14315.
The product of its (nonzero) digits is 2160, while the sum is 28.
Adding to 106610152213 its reverse (312251016601), we get a palindrome (418861168814).
The spelling of 106610152213 in words is "one hundred six billion, six hundred ten million, one hundred fifty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •