Base | Representation |
---|---|
bin | 110001010111010111… |
… | …0001001111101010101 |
3 | 101010122001112220221102 |
4 | 1202232232021331111 |
5 | 3214102200100401 |
6 | 120411153555445 |
7 | 10442016544121 |
oct | 1425656117525 |
9 | 333561486842 |
10 | 106010550101 |
11 | 40a60212385 |
12 | 18666875b85 |
13 | 9cc5b30571 |
14 | 51b9418581 |
15 | 2b56c5856b |
hex | 18aeb89f55 |
106010550101 has 4 divisors (see below), whose sum is σ = 106081556652. Its totient is φ = 105939543552.
The previous prime is 106010550097. The next prime is 106010550109. The reversal of 106010550101 is 101055010601.
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 64414947601 + 41595602500 = 253801^2 + 203950^2 .
It is a cyclic number.
It is not a de Polignac number, because 106010550101 - 22 = 106010550097 is a prime.
It is a super-2 number, since 2×1060105501012 (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 (106010550109) 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, 35501036 + ... + 35504021.
It is an arithmetic number, because the mean of its divisors is an integer number (26520389163).
Almost surely, 2106010550101 is an apocalyptic number.
It is an amenable number.
106010550101 is a deficient number, since it is larger than the sum of its proper divisors (71006551).
106010550101 is an equidigital number, since it uses as much as digits as its factorization.
106010550101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71006550.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 106010550101 its reverse (101055010601), we get a palindrome (207065560702).
The spelling of 106010550101 in words is "one hundred six billion, ten million, five hundred fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •