Base | Representation |
---|---|
bin | 110001011000100011… |
… | …0100110000010011001 |
3 | 101010201211202010222202 |
4 | 1202301012212002121 |
5 | 3214142412323001 |
6 | 120415142255545 |
7 | 10443013320161 |
oct | 1426106460231 |
9 | 333654663882 |
10 | 106050511001 |
11 | 40a80826616 |
12 | 186781275b5 |
13 | a0011b2376 |
14 | 51c085b5a1 |
15 | 2b5a4ed96b |
hex | 18b11a6099 |
106050511001 has 4 divisors (see below), whose sum is σ = 112288776372. Its totient is φ = 99812245632.
The previous prime is 106050510953. The next prime is 106050511003. The reversal of 106050511001 is 100115050601.
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 29155221001 + 76895290000 = 170749^2 + 277300^2 .
It is a cyclic number.
It is not a de Polignac number, because 106050511001 - 214 = 106050494617 is a prime.
It is a super-2 number, since 2×1060505110012 (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 (106050511003) 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, 3119132660 + ... + 3119132693.
It is an arithmetic number, because the mean of its divisors is an integer number (28072194093).
Almost surely, 2106050511001 is an apocalyptic number.
It is an amenable number.
106050511001 is a deficient number, since it is larger than the sum of its proper divisors (6238265371).
106050511001 is an equidigital number, since it uses as much as digits as its factorization.
106050511001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6238265370.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 106050511001 its reverse (100115050601), we get a palindrome (206165561602).
The spelling of 106050511001 in words is "one hundred six billion, fifty million, five hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •