Base | Representation |
---|---|
bin | 110001011011111000… |
… | …0100001001100110101 |
3 | 101011000121211201211202 |
4 | 1202313300201030311 |
5 | 3214410003231113 |
6 | 120434211342245 |
7 | 10445540336525 |
oct | 1426760411465 |
9 | 334017751752 |
10 | 106162164533 |
11 | 41028857567 |
12 | 186a95b1985 |
13 | a01b376249 |
14 | 51d1603685 |
15 | 2b65206258 |
hex | 18b7c21335 |
106162164533 has 4 divisors (see below), whose sum is σ = 107902527948. Its totient is φ = 104421801120.
The previous prime is 106162164529. The next prime is 106162164547. The reversal of 106162164533 is 335461261601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 36560116849 + 69602047684 = 191207^2 + 263822^2 .
It is a cyclic number.
It is not a de Polignac number, because 106162164533 - 22 = 106162164529 is a prime.
It is a super-2 number, since 2×1061621645332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106162164583) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 870181616 + ... + 870181737.
It is an arithmetic number, because the mean of its divisors is an integer number (26975631987).
Almost surely, 2106162164533 is an apocalyptic number.
It is an amenable number.
106162164533 is a deficient number, since it is larger than the sum of its proper divisors (1740363415).
106162164533 is an equidigital number, since it uses as much as digits as its factorization.
106162164533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1740363414.
The product of its (nonzero) digits is 77760, while the sum is 38.
The spelling of 106162164533 in words is "one hundred six billion, one hundred sixty-two million, one hundred sixty-four thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •