Base | Representation |
---|---|
bin | 110001101010110011… |
… | …1110111000000011001 |
3 | 101012022112122112102112 |
4 | 1203111213313000121 |
5 | 3221421240223113 |
6 | 121000030442105 |
7 | 10464133222511 |
oct | 1432547670031 |
9 | 335275575375 |
10 | 106663211033 |
11 | 41265669185 |
12 | 18809363335 |
13 | a09b106772 |
14 | 523bd8c841 |
15 | 2b941c95a8 |
hex | 18d59f7019 |
106663211033 has 8 divisors (see below), whose sum is σ = 110109669120. Its totient is φ = 103217109840.
The previous prime is 106663211003. The next prime is 106663211071. The reversal of 106663211033 is 330112366601.
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 106663211033 - 228 = 106394775577 is a prime.
It is a super-2 number, since 2×1066632110332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106663211003) 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, 603698 + ... + 760116.
It is an arithmetic number, because the mean of its divisors is an integer number (13763708640).
Almost surely, 2106663211033 is an apocalyptic number.
It is an amenable number.
106663211033 is a deficient number, since it is larger than the sum of its proper divisors (3446458087).
106663211033 is a wasteful number, since it uses less digits than its factorization.
106663211033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178447.
The product of its (nonzero) digits is 11664, while the sum is 32.
Adding to 106663211033 its reverse (330112366601), we get a palindrome (436775577634).
The spelling of 106663211033 in words is "one hundred six billion, six hundred sixty-three million, two hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •